Steiner tree problem with minimum number of Steiner points and bounded edge-length
- 1 January 1999
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 69 (2) , 53-57
- https://doi.org/10.1016/s0020-0190(98)00201-4
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A proof of the Gilbert-Pollak conjecture on the Steiner ratioAlgorithmica, 1992
- Bottleneck Steiner trees in the planeIEEE Transactions on Computers, 1992
- Global routing based on Steiner min-max treesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
- The Complexity of Computing Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1977
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968
- Minimum cost communication networksBell System Technical Journal, 1967