Abstract
Given a finite set of points in some metric space, a fundamental task is to find a shortest network interconnecting all of them. The network may include additional points, so-called Steiner points, which can be inserted at arbitrary places in order to minimize the total length with respect to the given metric. This paper focuses on uniform orientation metrics where the edges of the network are restricted to lie within a given set of legal directions. We here review the crucial insight that many versions of geometric network design problems can be reduced to the Steiner tree problem in finite graphs, namely the Hanan grid or its extensions.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bern, M.W., Plassmann, P.E.: The Steiner problem with edge lengths 1 and 2. Inf. Process. Lett. 32(4), 171–176 (1989)
Borradaile, G., Klein, P.N., Mathieu, C.: An O(n log n) approximation scheme for Steiner tree in planar graphs. ACM Trans. Algorithm. 5(3) (2009)
Brazil, M., Graham, R.L., Thomas, D.A., Zachariasen, M.: On the history of the Euclidean Steiner tree problem. Arch. Hist. Exact Sci. 68, 327–354 (2014)
Brazil, M., Thomas, D., Winter, P.: Minimum networks in uniform orientation metrics. SIAM J. Comput. 30(5), 1579–1593 (2000)
Brazil, M., Zachariasen, M.: The uniform orientation Steiner tree problem is NP-hard. Int. J. Comput. Geom. Appl. 24(2), 87–106 (2014)
Du, D.Z., Hwang, F.: Reducing the Steiner problem in a normed space. SIAM J. Comput. 21(6), 1001–1007 (1992)
de Fermat, P.: Oeuvres, vol. 1 (1891)
Garey, M., Johnson, D.: The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32, 826–834 (1977)
Gergonne, J.D.: Questions proposées. Problèmes de géométrie. Annales de Mathématiques pures et appliquées 1, 292 (1810–1811)
Hanan, M.: On Steiner’s problem with rectilinear distance. SIAM J. Appl. Math. 14, 255–265 (1966)
Hwang, F.K., Richards, D.S., Winter, P.: The Steiner tree problem. Ann. Discrete Math. 53 (1992)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)
Lee, D.T., Shen, C.F.: The Steiner minimal tree problem in the \(\lambda \)-geometry plane. In: Proceedings 7th International Symposium on Algorithms and Computations (ISAAC 1996). Lecture Notes in Computer Science, vol. 1178, pp. 247–255. Springer (1996)
Lin, G.H., Xue, G.: Reducing the Steiner problem in four uniform orientations. Networks 35(4), 287–301 (2000)
Müller-Hannemann, M., Peyer, S.: Approximation of rectilinear Steiner trees with length restrictions on obstacles. In: Dehne, F.K.H.A., Sack, J., Smid, M.H.M. (eds.) Algorithms and Data Structures, WADS 2003. Lecture Notes in Computer Science, vol. 2748, pp. 207–218. Springer (2003)
Müller-Hannemann, M., Schulze, A.: Approximation of octilinear Steiner trees constrained by hard and soft obstacles. In: Arge, L., Freivalds, R. (eds.) Algorithm Theory - SWAT 2006. Lecture Notes in Computer Science, vol. 4059, pp. 242–254. Springer (2006)
Müller-Hannemann, M., Schulze, A.: Hardness and approximation of octilinear Steiner trees. Int. J. Comput. Geom. Appl. 17(3), 231–260 (2007)
Prömel, H., Steger, A.: The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity. Advanced Lectures in Mathematics, Vieweg (2002)
Snyder, T.L.: On the exact location of Steiner points in general dimension. SIAM J. Comput. 21(1), 163–180 (1992)
Yan, G.Y., Albrecht, A.A., Young, G.H.F., Wong, C.K.: The Steiner tree problem in orientation metrics. J. Comput. Syst. Sci. 55, 529–546 (1997)
Zachariasen, M.: A catalog of Hanan grid problems. Networks 38, 76–83 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Müller-Hannemann, M. (2015). Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics. In: Schulz, A., Skutella, M., Stiller, S., Wagner, D. (eds) Gems of Combinatorial Optimization and Graph Algorithms . Springer, Cham. https://doi.org/10.1007/978-3-319-24971-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-24971-1_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24970-4
Online ISBN: 978-3-319-24971-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)