An approach for proving lower bounds: solution of Gilbert-Pollak's conjecture on Steiner ratio
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 76-85
- https://doi.org/10.1109/fscs.1990.89526
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- How to find Steiner minimal trees in euclideand-spaceAlgorithmica, 1992
- The Steiner ratio conjecture for six pointsJournal of Combinatorial Theory, Series A, 1991
- A variational approach to the Steiner network problemAnnals of Operations Research, 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
- 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
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968