The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation
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.
KeywordsLine Segment Point Pair Input Point Additional Segment Segment Endpoint
Unable to display preview. Download preview PDF.
- 1.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)Google Scholar
- 2.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