On steiner ratio conjectures
- 1 June 1991
- journal article
- section vi-steiner-tree-networks
- Published by Springer Nature in Annals of Operations Research
- Vol. 33 (6) , 437-449
- https://doi.org/10.1007/bf02071981
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A NEW BOUND FOR EUCLIDEAN STEINER MINIMAL TREESAnnals of the New York Academy of Sciences, 1985
- The steiner ratio conjecture is true for five pointsJournal of Combinatorial Theory, Series A, 1985
- A new bound for the Steiner ratioTransactions of the American Mathematical Society, 1983
- A short proof of a result of Pollak on Steiner minimal treesJournal of Combinatorial Theory, Series A, 1982
- Some remarks on the Steiner problemJournal of Combinatorial Theory, Series A, 1978
- A Lower Bound for the Steiner Tree ProblemSIAM Journal on Applied Mathematics, 1978
- The Complexity of Computing Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1977
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- On Steiner Minimal Trees with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1976
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968