On exact solutions to the Euclidean bottleneck Steiner tree problem

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.

[1]  Sang Won Bae,et al.  Exact Algorithms for the Bottleneck Steiner Tree Problem , 2011, Algorithmica.

[2]  Lusheng Wang,et al.  Approximations for a Bottleneck Steiner Tree Problem , 2001, Algorithmica.

[3]  Rolf Klein,et al.  The Farthest Color Voronoi Diagram and Related Problems , 2001 .

[4]  Sang Won Bae,et al.  On exact solutions to the Euclidean bottleneck Steiner tree problem , 2010, Inf. Process. Lett..

[5]  Michael Ben-Or,et al.  Lower bounds for algebraic computation trees , 1983, STOC.

[6]  Chak-Kuen Wong,et al.  A powerful global router: based on Steiner min-max trees , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[7]  Da-Ming Zhu,et al.  Approximation algorithm for bottleneck Steiner tree problem in the Euclidean plane , 2008, Journal of Computer Science and Technology.

[8]  D. Hearn,et al.  Minimax Multifacility Location with Euclidean Distances , 1976 .

[9]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[10]  Chak-Kuen Wong,et al.  Bottleneck Steiner Trees in the Plane , 1992, IEEE Trans. Computers.

[11]  G. O. Wesolowsky,et al.  A multi-facility minimax location method for Euclidean distances , 1973 .

[12]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[13]  Micha Sharir,et al.  The upper envelope of voronoi surfaces and its applications , 1991, SCG '91.

[14]  Christos H. Papadimitriou,et al.  On Two Geometric Problems Related to the Traveling Salesman Problem , 1984, J. Algorithms.

[15]  Lusheng Wang,et al.  An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane , 2002, Inf. Process. Lett..

[16]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[17]  Joseph L. Ganley,et al.  Optimal and approximate bottleneck Steiner trees , 1996, Oper. Res. Lett..