A rounding algorithm for approximating minimum Manhattan networks

被引:22
作者
Chepoi, Victor [1 ]
Nouioua, Karim [1 ]
Vaxes, Yann [1 ]
机构
[1] Univ Aix Marseille 2, Fac Sci Luminy, Lab Informat Fondamental Marseille, F-13288 Marseille, France
关键词
l(1)-distance; network design; linear programming; approximation algorithms;
D O I
10.1016/j.tcs.2007.10.013
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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 superset of 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 [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. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:56 / 69
页数:14
相关论文
共 18 条
[1]  
BENKERT M, 2004, P 20 EUR WORKSH COMP, P209
[2]  
BENKERT M, 2004, P 8 JAP C DISCR COMP, P85
[3]   The minimum Manhattan network problem: Approximations and exact solutions [J].
Benkert, Marc ;
Wolff, Alexander ;
Widmann, Florian ;
Shirabe, Takeshi .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2006, 35 (03) :188-208
[4]   FINDING EFFICIENT SOLUTIONS FOR RECTILINEAR DISTANCE LOCATION-PROBLEMS EFFICIENTLY [J].
CHALMET, LG ;
FRANCIS, RL .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1981, 6 (02) :117-124
[5]  
Eppstein D, 2000, HANDBOOK OF COMPUTATIONAL GEOMETRY, P425, DOI 10.1016/B978-044482537-7/50010-3
[6]  
Gudmundsson J., 2001, Nordic Journal of Computing, V8, P219
[7]  
GUDMUNDSSON J, 1999, P APPROX 99, P28
[8]  
Kato R, 2002, LECT NOTES COMPUT SC, V2518, P344
[9]   Picking alignments from (Steiner) trees [J].
Lam, F ;
Alexandersson, M ;
Pachter, L .
JOURNAL OF COMPUTATIONAL BIOLOGY, 2003, 10 (3-4) :509-520
[10]  
Narasimhan G, 2007, GEOMETRIC SPANNER NETWORKS, P1, DOI 10.2277/ 0521815134