Abstract
We present a polynomial time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the number of terminals plus obstacle vertices. To this end, we show how a planar spanner of size O(n logn) can be constructed that contains a (1 + ε)-approximation of the optimal tree. Then one can find an approximately optimal Steiner tree in the spanner using the algorithm of Borradaile et al. (2007) for the Steiner tree problem in planar graphs. We prove this result for the Euclidean metric and also for all uniform orientation metrics, i.e. particularly the rectilinear and octilinear metrics.
This is a preview of subscription content, log in via an institution to check access.
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
Borradaile, G., Kenyon-Mathieu, C., Klein, P.N.: A polynomial-time approximation scheme for Steiner tree in planar graphs. In: SODA 2007. Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1285–1294 (2007)
Borradaile, G., Kenyon-Mathieu, C., Klein, P.N.: Steiner tree in planar graphs: An O(n logn) approximation scheme with singly exponential dependence on epsilon. In: WADS 2007. LNCS, Springer, Heidelberg (2007)
Garey, M., Graham, R., Johnson, D.: The complexity of computing Steiner minimal trees. SIAM Journal on Applied Mathematics 32, 835–859 (1977)
Arora, S.: Polynomial time approximation schemes for the Euclidean traveling salesman and other geometric problems. Journal of the ACM 45, 753–782 (1998)
Mitchell, J.S.B.: Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM Journal on Computing 28, 1298–1309 (1999)
Rao, S.B., Smith, W.D.: Approximating geometrical graphs via ”spanners” and ”banyans”. In: STOC 1998. Proceedings of the 30th annual ACM Symposium on Theory of Computing, pp. 540–550. ACM Press, New York (1998)
Provan, J.S.: An approximation scheme for finding steiner trees with obstacles. SIAM Journal on Computing 17, 920–934 (1988)
Garey, M., Johnson, D.: The rectilinear Steiner tree problem is NP-complete. SIAM Journal on Applied Mathematics 32, 826–834 (1977)
Müller-Hannemann, M., Schulze, A.: Hardness and approximation of octilinear Steiner trees. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 256–265. Springer, Heidelberg (2005)
Brazil, M., Thomas, D., Winter, P.: Minimum networks in uniform orientation metrics. SIAM Journal on Computing 30, 1579–1593 (2000)
Ganley, J.L., Cohoon, J.P.: Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles. In: Proceedings of the International Symposium on Circuits and Systems, pp. 113–116 (1994)
Müller-Hannemann, M., Schulze, A.: Approximation of octilinear Steiner trees constrained by hard and soft obstacles. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 242–254. Springer, Heidelberg (2006)
Liu, J., Zhao, Y., Shragowitz, E., Karypis, G.: A polynomial time approximation scheme for rectilinear Steiner minimum tree construction in the presence of obstacles. In: 9th IEEE International Conference on Electronics, Circuits and Systems. vol. 2, pp. 781–784 (2002)
Müller-Hannemann, M., Peyer, S.: Approximation of rectilinear Steiner trees with length restrictions on obstacles. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 207–218. Springer, Heidelberg (2003)
Bern, M., Plassmann, P.: The Steiner problem with edge lengths 1 and 2. Information Processing Letters 32, 171–176 (1989)
Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: SODA 2000. Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 770–779 (2000)
Hanan, M.: On Steiner’s problem with rectilinear distance. SIAM Journal on Applied Mathematics 14, 255–265 (1966)
Arikati, S.R., Chen, D.Z., Chew, L.P., Das, G., Smid, M.H.M., Zaroliagis, C.D.: Planar spanners and approximate shortest path queries among obstacles in the plane. In: Díaz, J. (ed.) ESA 1996. LNCS, vol. 1136, pp. 514–528. Springer, Heidelberg (1996)
Eppstein, D.: Spanning trees and spanners. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425–461. Elsevier, Amsterdam (2000)
Clarkson, K.: Approximation algorithms for shortest path motion planning. In: STOC 1987. Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 56–65. ACM Press, New York (1987)
Zeh, N.: I/O-Efficient Algorithms for Shortest Path Related Problems. PhD thesis, Carleton University, Ottawa, Canada (2002)
Gilbert, E.N., Pollak, H.O.: Steiner minimal trees. SIAM Journal on Applied Mathematics 16, 1–29 (1968)
Zachariasen, M., Winter, P.: Obstacle-avoiding Euclidean Steiner trees in the plane: An exact approach. In: Goodrich, M.T., McGeoch, C.C. (eds.) ALENEX 1999. LNCS, vol. 1619, pp. 282–295. Springer, Heidelberg (1999)
Hwang, F.: On Steiner minimal trees with rectilinear distance. SIAM Journal on Applied Mathematics 30, 104–114 (1976)
Prömel, H., Steger, A.: The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity. Advanced Lectures in Mathematics, Vieweg (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Müller-Hannemann, M., Tazari, S. (2007). A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane. In: Dehne, F., Sack, JR., Zeh, N. (eds) Algorithms and Data Structures. WADS 2007. Lecture Notes in Computer Science, vol 4619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73951-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-73951-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73948-7
Online ISBN: 978-3-540-73951-7
eBook Packages: Computer ScienceComputer Science (R0)