A decomposition theorem on Euclidean Steiner minimal trees
- 47 Downloads
The Euclidean Steiner minimal tree problem is known to be an NP-complete problem and current alogorithms cannot solve problems with more than 30 points. Thus decomposition theorems can be very helpful in extending the boundary of workable problems. There have been only two known decomposition theorems in the literature. This paper provides a 50% increase in the reservoir of decomposition theorems.
KeywordsEquilateral Triangle Discrete Comput Geom Steiner Tree Decomposition Theorem Steiner Point
- 2.D. Z. Du, F. K. Hwang, and G. Y. Ting, Steiner minimal trees on sets of four points,Discrete Comput. Geom. to appear.Google Scholar