A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is
Journal of the ACM
An iterative method is described which generates a minimal tree with a Steiner topology in at most n -2 steps, where n is the number of fixed vertices. The SI algorithm is formulated. When n < 4, the SI algorithm converges to a proper tree. Experimental studies indicate that this algorithm generates trees close to optimal Steiner minimal trees. KEY WORDS AND PHRASES: shortest connection network, minimal spanning tree, Steiner minimal tree. CR CATEGORY NUMBERS: 3.57, 3.81, 5.32 In this paper andoi:10.1145/321724.321733 fatcat:wba5yb4akrep3pba47m52jzm2m