Abstract
Given n terminals in the plane ℝ2 and a positive integer k, the bottleneck Steiner tree problem is to find k Steiner points in ℝ2 so that the longest edge length of the resulting Steiner tree is minimized. In this paper, we study this problem in any L p metric. We present the first fixed-parameter tractable algorithm running in O(f(k)·n 2logn) time for the L 1 and the L ∞ metrics, and the first exact algorithm for any other L p metric with 1 < p < ∞ whose time complexity is O(f(k)·(n k + n logn)), where f(k) is a function dependent only on k. Note that prior to this paper there was no known exact algorithm even for the L 2 metric, and our algorithms take a polynomial time in n for fixed k.
Work by S.W.Bae was supported by the Brain Korea 21 Project. Work by C.Lee and S.Choi was supported by the Korea Science and Engineering Fouundation (KOSEF) grant funded by the Korea Government (MEST) (No.R01-2007-000-20865-0). Work by S.Tanigawa was supported by Grant-in-Aid for JSPS Research Fellowship for Young Scientists.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Sacristan, V.: The farthest color Voronoi diagram and related problems. In: Proc. 17th European Workshop Comput. Geom., pp. 113–116 (2001)
Agarwal, P.K., Aronov, B., Sharir, M.: Computing envelopes in four dimensions with applications. SIAM J. Comput. 26(6), 1714–1732 (1997)
Bae, S.W., Lee, C., Choi, S.: On exact solutions to the Euclidean bottleneck Steiner tree problem. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol. 5431, pp. 105–116. Springer, Heidelberg (2009)
Chiang, C., Sarrafzadeh, M., Wong, C.: A powerful global router: based on Steiner min-max trees. In: Proc. IEEE Int. Conf. CAD, pp. 2–5 (1989)
Ganley, J.L., Salowe, J.S.: Optimal and approximate bottleneck Steiner trees. Oper. Res. Lett. 19, 217–224 (1996)
Huttenlocher, D.P., Kedem, K., Sharir, M.: The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom. 9, 267–291 (1993)
Li, Z.-M., Zhu, D.-M., Ma, S.-H.: Approximation algorithm for bottleneck Steiner tree problem in the Euclidean plane. J. Comput. Sci. Tech. 19(6), 791–794 (2004)
Sarrafzadeh, M., Wong, C.: 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, 554–561 (2002)
Wang, L., Li, Z.: An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane. Inform. Process. Lett. 81, 151–156 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bae, S.W., Choi, S., Lee, C., Tanigawa, Si. (2009). Exact Algorithms for the Bottleneck Steiner Tree Problem. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-10631-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10630-9
Online ISBN: 978-3-642-10631-6
eBook Packages: Computer ScienceComputer Science (R0)