论文信息 - Steiner minimal tree for points on a circle

Steiner minimal tree for points on a circle

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 p which has been well studied in the literature.

F. K. Hwang | D. Z. Du | S. C. Chao

[1] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[2] David S. Johnson,et al. The Complexity of Computing Steiner Minimal Trees , 1977 .

[3] David S. Johnson,et al. A note on bisecting minimum spanning trees , 1978, Networks.

[4] R. Prim. Shortest connection networks and some generalizations , 1957 .

[5] Ding-Zhu Du,et al. A new bound for the steiner ratio , 1983 .