Approximate Euclidean Steiner Trees | Journal of Optimization...
This construction, also known as the Melzak algorithm [7], can be done in linear time [8]. On the other hand, determining the topology of a minimum Steiner tree is hard. There is a super-exponential number of d