Abstract
For a set T of n points (terminals) in the plane, a Manhattan network on T is a network N(T)=(V,E) with the property that its edges are horizontal or vertical segments connecting points in V ⊇ T and for every pair of terminals, the network N(T) contains a shortest l 1-path between them. A minimum Manhattan network on T is a Manhattan network of minimum possible length. The problem of finding minimum Manhattan networks has been introduced by Gudmundsson, Levcopoulos, and Narasimhan (APPROX’99) and it is not known whether this problem is in P or not. Several approximation algorithms (with factors 8,4, and 3) have been proposed; recently Kato, Imai, and Asano (ISAAC’02) have given a factor 2 approximation algorithm, however their correctness proof is incomplete. In this note, we propose a rounding 2-approximation algorithm based on a LP-formulation of the minimum Manhattan network problem.
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.
Similar content being viewed by others
References
Benkert, M., Shirabe, T., Wolff, A.: The minimum Manhattan network problem - approximations and exact solutions. In: 20th EWCG, Seville, Spain, March 25-26 (2004)
Chalmet, G., Francis, L., Kolen, A.: Finding efficient solutions for rectilinear distance location problems efficiently. European J. Operations Research 6, 117–124 (1981)
Eppstein, D.: Spanning trees and spanners. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425–461. Elsevier, Amsterdam (1999)
Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Approximating a minimum Manhattan network. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol. 1671, pp. 28–37. Springer, Heidelberg (1999)
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., Alexanderson, M., Pachter, L.: Picking alignements from (Steiner) trees. J. Computational Biology 10, 509–520 (2003)
Nouioua, K.: Une approche primale-duale pour le problème du réseau de Manhattan minimal, RAIRO Operations Research (submitted)
Tardos, E.: A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research 34, 250–256 (1986)
Wendell, R.E., Hurter, A.P., Lowe, T.J.: Efficient points in location theory. AIEE Transactions 9, 314–321 (1973)
Zachariasen, M.: A catalog of Hanan grid problems. Networks 38, 76–83 (2001)
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
Chepoi, V., Nouioua, K., Vaxès, Y. (2005). A Rounding Algorithm for Approximating Minimum Manhattan Networks. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds) Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2005 2005. Lecture Notes in Computer Science, vol 3624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11538462_4
Download citation
DOI: https://doi.org/10.1007/11538462_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28239-6
Online ISBN: 978-3-540-31874-3
eBook Packages: Computer ScienceComputer Science (R0)