A Fast Approximation Algorithm for TSP with Neighborhoods

In TSP with neighborhoods (TSPN) we are given a collection X of k polygonal regions in the plane, called neighborhoods, with totally n vertices, and we seek the shortest tour that visits each neighborhood. In this paper we present a simple and fast algorithm that, given a start point, computes a TSPN tour of length O(log k) times the optimum in time O(n+k log k). When no start point is given we show how to compute a "good" start point in time O(n2 logn), hence we obtain a logarithmic approximation algorithm that runs in time O(n2 log n). We also present an algorithm which performs at least one of the following two tasks (which of these tasks is performed depends on the given input): (1) It outputs in time O(n log n) a TSPN tour of length O(log k) times the optimum. (2) It outputs a TSPN tour of length less than (1 + e) times the optimum in time O(n3), where e is an arbitrary real constant given as an optional parameter.The same approach can be used for the Red-Blue Separation Problem. We show an algorithm with logarithmic approximation ratio that runs in time O(n log n), where n is the total number of points.

[1]  Ronald L. Graham,et al.  Some NP-complete geometric problems , 1976, STOC '76.

[2]  Gabriele Reich,et al.  Beyond Steiner's Problem: A VLSI Oriented Generalization , 1989, WG.

[3]  Sanjeev Arora,et al.  Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems , 1997, RANDOM.

[4]  Joseph S. B. Mitchell,et al.  Approximation algorithms for geometric tour and network design problems (extended abstract) , 1995, SCG '95.

[5]  Esther M. Arkin,et al.  Approximation Algorithms for the Geometric Covering Salesman Problem , 1994, Discret. Appl. Math..

[6]  Teofilo F. Gonzalez,et al.  Bounds for partitioning rectilinear polygons , 1985, SCG '85.

[7]  Peter Eades,et al.  The complexity of computing minimum separating polygons , 1993, Pattern Recognit. Lett..

[8]  Christos Levcopoulos.  Fast heuristics for minimum length rectangular partitions of polygons , 1986, SCG '86.

[9]  Miles H. Krumbine.  Hell , 1930, The Journal of Religion.

[10]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[11]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[12]  Rae A. Earnshaw,et al.  Theoretical Foundations of Computer Graphics and CAD , 1988, NATO ASI Series.

[13]  Joseph S. B. Mitchell,et al.  Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..

[14]  Christos H. Papadimitriou,et al.  The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..

[15]  GraphsThomas,et al.  Polynomial-Time Approximation S hemes for Geometri , 2001 .

[16]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[17]  Subhash Suri,et al.  A pedestrian approach to ray shooting: shoot a ray, take a walk , 1993, SODA '93.