Approximation Algorithms for the Geometric Covering Salesman Problem

Abstract We introduce a geometric version of the Covering Salesman Problem: Each of the n salesman's clients specifies a neighborhood in which they are willing to meet the salesman. Identifying a tour of minimum length that visits all neighboirhoods is an NP-hard problem, since it is a generalization of the Traveling Salesman Problem. We present simple heuristic procedures for constructing tours, for a variety of neighborhood types, whose length is guaranteed to be within a constant factor of the length of an optimal tour. The neighborhoods we consider include parallel unit segments, translates of a polygonal region, and circles.

[1]  Alok Aggarwal,et al.  Fast algorithms for computing the largest empty rectangle , 1987, SCG '87.

[2]  G. L. Nemhauser,et al.  Tight bounds for christofides' traveling salesman heuristic , 1978, Math. Program..

[3]  David P. Williamson,et al.  A note on the prize collecting traveling salesman problem , 1993, Math. Program..

[4]  Alan Frieze,et al.  An extension of Christofides heuristic to the k-person travelling salesman problem , 1983, Discret. Appl. Math..

[5]  Greg N. Frederickson,et al.  Approximation Algorithms for Some Postman Problems , 1979, JACM.

[6]  Daniel J. Rosenkrantz,et al.  An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[7]  Refael Hassin,et al.  The swapping problem , 1992, Networks.

[8]  Angel Corberán Salvador,et al.  Análisis de heurísticos para el problema del cartero rural , 1985 .

[9]  Simeon C. Ntafos,et al.  Watchman Routes Under Limited Visibility , 1991, Comput. Geom..

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

[11]  John R. Current,et al.  The Covering Salesman Problem , 1989, Transp. Sci..

[12]  Chul E. Kim,et al.  Approximation algorithms for some routing problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[13]  Chul E. Kim,et al.  Approximation Algorithms for Some Routing Problems , 1978, SIAM J. Comput..

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

[15]  Esther M. Arkin,et al.  The Lawnmower Problem , 1993, Canadian Conference on Computational Geometry.

[16]  Simeon Ntafos,et al.  Watchman routes under limited visibility , 1992 .