1. Steiner minimal tree for points on a circle
- Author
-
S. C. Chao, D. Z. Du, and F. K. Hwang
- Subjects
Combinatorics ,Set (abstract data type) ,symbols.namesake ,Applied Mathematics ,General Mathematics ,Shortest path problem ,MathematicsofComputing_GENERAL ,symbols ,Steiner tree problem ,Steiner minimal tree ,Mathematics - 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.
- Published
- 1985
- Full Text
- View/download PDF