A proof of the Gilbert-Pollak conjecture on the Steiner ratio
Authors:
- 1 June 1992
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 7 (1-6) , 121-135
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On Steiner minimal trees withL p distanceAlgorithmica, 1992
- How to find Steiner minimal trees in euclideand-spaceAlgorithmica, 1992
- The Steiner ratio conjecture for six pointsJournal of Combinatorial Theory, Series A, 1991
- A NEW BOUND FOR EUCLIDEAN STEINER MINIMAL TREESAnnals of the New York Academy of Sciences, 1985
- A new bound for the Steiner ratioTransactions of the American Mathematical Society, 1983
- 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
- On Steiner Minimal Trees with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1976
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968