Abstract

We study the Euclidean bottleneck Steiner tree problem: given a set P of n points in the Euclidean plane, called terminals, find a Steiner tree with at most k Steiner points such that the length of the longest edge in the tree is minimized. This problem is known to be NP-hard even to approximate within ratio $\sqrt{2}$. We focus on finding exact solutions to the problem for a small constant k . Based on geometric properties of optimal location of Steiner points, we present an O (n logn ) time exact algorithm for k = 1 and an O (n 2) time algorithm for k = 2. Also, we present an O (n logn ) time exact algorithm to the problem for a special case where there is no edge between Steiner points.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.