Back to Search
Start Over
A rounding algorithm for approximating minimum Manhattan networks
- Source :
-
Theoretical Computer Science . Jan2008, Vol. 390 Issue 1, p56-69. 14p. - Publication Year :
- 2008
-
Abstract
- Abstract: For a set of points (terminals) in the plane, a Manhattan network on is a network with the property that its edges are horizontal or vertical segments connecting points in and for every pair of terminals, the network contains a shortest -path between them. A minimum Manhattan network on is a Manhattan network of minimum possible length. The problem of finding minimum Manhattan networks has been introduced by Gudmundsson, Levcopoulos, and Narasimhan [J. Gudmundsson, C. Levcopoulos, G. Narasimhan, Approximating a minimum Manhattan network, Nordic Journal of Computing 8 (2001) 219–232. Proc. APPROX’99, 1999, pp. 28–37] and its complexity status is unknown. Several approximation algorithms (with factors 8, 4, and 3) have been proposed; recently Kato, Imai, and Asano [R. Kato, K. Imai, T. Asano, An improved algorithm for the minimum Manhattan network problem, ISAAC’02, in: LNCS, vol. 2518, 2002, pp. 344–356] have given a factor 2-approximation algorithm, however their correctness proof is incomplete. In this paper, we propose a rounding 2-approximation algorithm based on an LP-formulation of the minimum Manhattan network problem. [Copyright &y& Elsevier]
- Subjects :
- *ALGORITHMS
*COMPUTER science
*COMPUTER logic
*SYSTEMS design
*INFORMATION science
Subjects
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 390
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 28117349
- Full Text :
- https://doi.org/10.1016/j.tcs.2007.10.013