Abstract
Given two sets in the plane, R of n (terminal) points and S of m (Steiner) points, a full Steiner tree is a Steiner tree in which all points of R are leaves. In the bottleneck full Steiner tree (BFST) problem, one has to find a full Steiner tree T (with any number of Steiner points from S), such that the length of the longest edge in T is minimized, and, in the k-BFST problem, has to find a full Steiner tree T with at most k≤m Steiner points from S such that the length of the longest edge in T is minimized. The problems are motivated by wireless network design.
In this paper, we present an exact algorithm of \({{{\mathcal {O}}}}((n+m)\log^{2}{m})\) time to solve the BFST problem. Moreover, we show that the k-BFST problem is NP-hard and that there exists a polynomial-time approximation algorithm for the problem with performance ratio 4.
Similar content being viewed by others
References
Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998)
Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. J. ACM 45(3), 501–555 (1998)
Bae, S.W., Lee, C., Choi, S.: On exact solutions to the Euclidean bottleneck Steiner tree problem. Inf. Process. Lett. 110(16), 672–678 (2010)
Berman, P., Ramaiyer, V.: Improved approximation for the Steiner tree problem. J. Algorithms 17(3), 381–408 (1994)
Borchers, A., Du, D.Z.: The k-Steiner ratio in graphs. SIAM J. Comput. 26(3), 857–869 (1997)
Byrka, J., Grandoni, F., Rothvoß, T., Sanità, L.: An improved LP-based approximation for Steiner tree. In: Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC ’10), pp. 583–592 (2010)
Chen, D., Du, D.-Z., Hu, X., Lin, G., Wang, L., Xue, G.: Approximations for Steiner trees with minimum number of Steiner points. J. Glob. Optim. 18(1), 17–33 (2000)
Chen, Y.H., Lu, C.L., Tang, C.Y.: On the full and bottleneck full Steiner tree problems. In: Proceedings of the 9th Annual International Conference on Computing and Combinatorics (COCOON ’03), pp. 122–129 (2003)
Cheng, X., Du, D.Z.: Steiner Trees in Industry. Kluwer Academic, Dordrecht (2001)
Cheng, X., Du, D.-Z., Wang, L., Xu, B.: Relay sensor placement in wireless sensor networks. Wirel. Netw. 14(3), 347–355 (2008)
Chrobak, M., Payne, T.H.: A linear-time algorithm for drawing a planar graph on a grid. Inf. Process. Lett. 54(4), 241–246 (1995)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)
de Berg, M., Cheong, O., Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, Berlin (2008)
Drake, D.E., Hougardy, S.: On approximation algorithms for the terminal Steiner tree problem. Inf. Process. Lett. 89(1), 15–19 (2004)
Du, D.Z., Smith, J.M., Rubinstein, J.H.: Advances in Steiner Trees. Kluwer Academic, Dordrecht (2000)
Duin, C.W., Volgenant, A.: The partial sum criterion for Steiner trees in graphs and shortest paths. Eur. J. Oper. Res. 97(1), 172–182 (1997)
Garey, M.R., Graham, R.L., Johnson, D.S.: The complexity of computing Steiner minimal trees. SIAM J. Appl. Math. 32(4), 835–859 (1977)
Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32(4), 826–834 (1977)
Hougardy, S., Prömel, H.J.: A 1.598 approximation algorithm for the Steiner problem in graphs. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’99), pp. 448–453 (1999)
Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Elsevier, Amsterdam (1992)
Kahng, A.B., Robins, G.: On Optimal Interconnections for VLSI. Kluwer Academic, Dordrecht (1995)
Karpinski, M., Zelikovsky, A.: New approximation algorithms for the Steiner tree problem. J. Comb. Optim. 1(1), 47–65 (1995)
Li, Z.-M., Zhu, D.-M., Ma, S.-H.: Approximation algorithm for bottleneck Steiner tree problem in the Euclidean plane. J. Comput. Sci. Technol. 19(6), 791–794 (2004)
Lin, G.H., Xue, G.: Steiner tree problem with minimum number of Steiner points and bounded edge-length. Inf. Process. Lett. 69, 53–57 (1999)
Lin, G.H., Xue, G.: On the terminal Steiner tree problem. Inf. Process. Lett. 84(2), 103–107 (2002)
Lu, C.L., Tang, C.Y., Lee, R.C.T.: The full Steiner tree problem. Theor. Comput. Sci. 306(1–3), 55–67 (2003)
Martinez, F.V., de Pina, J.C., Soares, J.: Algorithms for terminal Steiner trees. Theor. Comput. Sci. 389(1–2), 133–142 (2007)
Prömel, H.J., Steger, A.: A new approximation algorithm for the Steiner tree problem with performance ratio 5/3. J. Algorithms 36(1), 89–101 (2000)
Sarrafzadeh, M., Wong, C.K.: Bottleneck Steiner trees in the plane. IEEE Trans. Comput. 41(3), 370–374 (1992)
Wang, L., Du, D.-Z.: Approximations for a bottleneck Steiner tree problem. Algorithmica 32(4), 554–561 (2002)
Wang, L., Li, Z.: An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane. Inf. Process. Lett. 81(3), 151–156 (2002)
Acknowledgements
The author would like to thank Matthew Katz and Paz Carmi for helpful discussions.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Abu-Affash, A.K. The Euclidean Bottleneck Full Steiner Tree Problem. Algorithmica 71, 139–151 (2015). https://doi.org/10.1007/s00453-013-9788-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-013-9788-x