Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 
 

 

Steiner minimal tree for points on a circle


Authors: D. Z. Du, F. K. Hwang and S. C. Chao
Journal: Proc. Amer. Math. Soc. 95 (1985), 613-618
MSC: Primary 05C05; Secondary 52A40, 94C15
DOI: https://doi.org/10.1090/S0002-9939-1985-0810173-6
MathSciNet review: 810173
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: We show that the Steiner minimal tree for a set of points on a circle is the shortest path connecting them if at most one distance between two consecutive points is "large". We prove this by making an interesting use of the Steiner ratio $ \rho $ which has been well studied in the literature.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 05C05, 52A40, 94C15

Retrieve articles in all journals with MSC: 05C05, 52A40, 94C15


Additional Information

DOI: https://doi.org/10.1090/S0002-9939-1985-0810173-6
Article copyright: © Copyright 1985 American Mathematical Society

American Mathematical Society