Abstract
It was conjectured by Gilbert and Pollak [5] that for any finite set of points in the Euclidean plane, the ratio of the length of a Steiner minimal tree to the length of a minimal spanning tree is at least √3/2. The present paper proves the conjecture for five points, using a formula for the length of full Steiner trees.
Similar content being viewed by others
References
R.S. Booth, Analytic formulas for full Steiner trees, discrete and computational geometry, to appear.
D.Z. Du and F.K. Hwang, A new bound for the Steiner ratio, Trans. Amer. Math. Soc. 278 (1)(1983)137–148.
D.Z. Du, E.Y. Yao and F.K. Hwang, A short proof of a result of Pollak on Steiner minimal trees, J. Combinatorial Theory, Series A, 32(1982)396–400.
D.Z. Du, E. Yao and F.K. Hwang, The Steiner ratio conjecture is true for five points, J. Combinatorial Theory, Series A, 38(1985)230–240.
E.N. Gilbert and H.O. Pollak, Steiner minimal trees, SIAM J. Appl. Math. 16(1968)1–29.
Z.A. Melzak, On the problem of Steiner, Can. Math. Bull. 4(1961)143–148.
H.O. Pollak, Some remarks on the Steiner problem, J. Combinatorial Theory, Series A, 24 (3)(1978)278–295.
J.H. Rubinstein and D.A. Thomas, The Steiner ratio conjecture for six points, to appear.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Booth, R.S. The steiner ratio for five points. Ann Oper Res 33, 419–436 (1991). https://doi.org/10.1007/BF02071980
Issue Date:
DOI: https://doi.org/10.1007/BF02071980