Abstract
A Steiner minimal treeS is a network of shortest possible length connecting a set ofn points in the plane. LetT be a shortest tree connecting then points but with vertices only at these points.T is called a minimal spanning tree. The Steiner ratio conjecture is that the length ofS divided by the length ofT is at least √3/2. In this paper we use a variational approach to show that if then points lie on a circle, then the Steiner ratio conjecture holds.
Article PDF
Similar content being viewed by others
References
F. R. K. Chung and R. L. Graham, A new bound for Euclidean Steiner minimal trees,Ann. N. Y. Acad. Sci. 440 (1985), 328–346.
D. Z. Du, F. K. Hwang, and E. N. Yao, The Steiner ratio conjecture is true for five points,J. Combin. Theory Ser. A 38 (1985), 230–240.
D. Z. Du, E. N. Yao, and F. K. Hwang, A short proof of a result of Pollak on Steiner minimal trees,J. Combin. Theory Ser. A 32 (1982), 396–400.
E. N. Gilbert and H. O. Pollak, Steiner minimal trees,SIAM J. Appl. Math. 16 (1968), 1–29.
H. O. Pollak, Some remarks on the Steiner problem,J. Combin. Theory Ser. A 24 (1978), 278–295.
J. H. Rubinstein and D. A. Thomas, A variational approach to the Steiner network problem,Ann. Oper. Res., to appear.
J. H. Rubinstein and D. A. Thomas, The Steiner ratio conjecture for six points,J. Combin. Theory Ser. A, to appear.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rubinstein, J.H., Thomas, D.A. The Steiner ratio conjecture for cocircular points. Discrete Comput Geom 7, 77–86 (1992). https://doi.org/10.1007/BF02187826
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02187826