Approximations for a Bottleneck Steiner Tree Problem

AbstractIn the design of wireless communication networks, due to a budget limit, suppose we could put totally n+k stations in the plane. However, n of them must be located at given points. Of course, one would like to have the distance between stations as small as possible. The problem is how to choose locations for other k stations to minimize the longest distance between stations. This problem is NP-hard. We show that if NP \neq P , no polynomial-time approximation for the problem in the rectilinear plane has a performance ratio less than 2 and no polynomial-time approximation for the problem in the Euclidean plane has a performance ratio less than \sqrt 2 and that there exists a polynomial-time approximation with performance ratio 2 for the problem in both the rectilinear plane and the Euclidean plane.

[1]  Chung-Sheng Li,et al.  Gain equalization in metropolitan and wide area optical networks using optical amplifiers , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[2]  David S. Johnson,et al.  The Rectilinear Steiner Problem is NP-Complete , 1977 .

[3]  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.

[4]  Guohui Lin,et al.  Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length , 1999, Inf. Process. Lett..

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

[6]  J. Hyam Rubinstein,et al.  Compression Theorems and Steiner Ratios on Spheres , 1997, J. Comb. Optim..

[7]  E. Gilbert.  Minimum cost communication networks , 1967 .

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

[9]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[10]  Marek Karpinski,et al.  New Approximation Algorithms for the Steiner Tree Problems , 1997, J. Comb. Optim..

[11]  David S. Johnson,et al.  The Complexity of Computing Steiner Minimal Trees , 1977 .

[12]  Dana S. Richards,et al.  Steiner tree problems , 1992, Networks.

[13]  Lusheng Wang,et al.  Approximations for Steiner Trees with Minimum Number of Steiner Points , 2000, J. Glob. Optim..

[14]  Hosam M. F. AboElFotoh.  Algorithms for computing message delay for wireless networks , 1997, Networks.

[15]  J. Soukup.  On Minimum Cost Networks with Nonlinear Costs , 1975 .

[16]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[17]  H. Pollak,et al.  Steiner Minimal Trees , 1968 .

[18]  Byrav Ramamurthy,et al.  Minimizing the number of optical amplifiers needed to support a multi-wavelength optical LAN/MAN , 1997, Proceedings of INFOCOM '97.