Abstract
Given a set of nodes in the plane and a constant t ≥ 1, a Euclidean t-spanner is a network in which, for any pair of nodes, the ratio of the network distance and the Euclidean distance of the two nodes is at most t. These networks have applications in transportation or communication network design and have been studied extensively.
In this paper we study 1-spanners under the Manhattan (or L 1-) metric. Such networks are called Manhattan networks. A Manhattan network for a set of nodes can be seen as a set of axis-parallel line segments whose union contains an x- and y-monotone path for each pair of nodes. It is not known whether it is NP-hard to compute minimum Manhattan networks, i.e. Manhattan networks of minimum total length. In this paper we present a factor-3 approximation algorithm for this problem. Given a set of n nodes, our algorithm takes O(n log n) time and linear space.
This work was supported by grant WO 758/4-1 of the German Science Foundation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Arya, S., Das, G., Mount, D.M., Salowe, J.S., Smid, M.: Euclidean spanners: Short, thin, and lanky. In: Andersson, S.I. (ed.) Summer University of Southern Stockholm 1993. LNCS, vol. 888, pp. 489–498. Springer, Heidelberg (1995)
Benkert, M., Widmann, F., Wolff, A.: The minimum Manhattan network problem: A fast factor-3 approximation. Technical Report 2004-16, Fakultät für Informatik, Universität Karlsruhe (2004), Available at http://www.ubka.uni-karlsruhe.de/cgi-bin/psview?document=/ira/2004/16
Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Approximating a minimum Manhattan network. Nordic J. Comput. 8, 219–232 (2001)
Kato, R., Imai, K., Asano, T.: An improved algorithm for the minimum Manhattan network problem. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 344–356. Springer, Heidelberg (2002)
Lam, F., Alexandersson, M., Pachter, L.: Picking alignments from (Steiner) trees. Journal of Computational Biology 10, 509–520 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benkert, M., Wolff, A., Widmann, F. (2005). The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. In: Akiyama, J., Kano, M., Tan, X. (eds) Discrete and Computational Geometry. JCDCG 2004. Lecture Notes in Computer Science, vol 3742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11589440_2
Download citation
DOI: https://doi.org/10.1007/11589440_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30467-8
Online ISBN: 978-3-540-32089-0
eBook Packages: Computer ScienceComputer Science (R0)