论文信息 - A 1.5-Approximation of the Minimal Manhattan Network Problem

A 1.5-Approximation of the Minimal Manhattan Network Problem

Given a set of points in the plane, the Minimal Manhattan Network Problem asks for an axis-parallel network that connects every pair of points by a shortest path under L1-norm (Manhattan metric). The goal is to minimize the overall length of the network. We present an approximation algorithm that provides a solution of length at most 1.5 times the optimum. Previously, the best known algorithm has given only a 2-approximation.

Sebastian Seibert | Walter Unger

[1] Takao Asano,et al. An Improved Algorithm for the Minimum Manhattan Network Problem , 2002, ISAAC.

[2] Victor Chepoi,et al. A Rounding Algorithm for Approximating Minimum Manhattan Networks , 2005, APPROX-RANDOM.

[3] Joachim Gudmundsson,et al. Fast Greedy Algorithms for Constructing Sparse Geometric Spanners , 2002, SIAM J. Comput..

[4] Joachim Gudmundsson,et al. Approximating a Minimum Manhattan Network , 2001, Nord. J. Comput..

[5] Alexander Wolff,et al. The minimum Manhattan network problem: Approximations and exact solutions , 2006, Comput. Geom..

[6] Michiel H. M. Smid,et al. Lower bounds for computing geometric spanners and approximate shortest paths , 1996, Discret. Appl. Math..

[7] David P. Dobkin,et al. On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..

[8] Alexander Wolff,et al. The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation , 2004, JCDCG.