In the TSP with neighborhoods problem we are given a set of n regions (neighborhoods) in the plane, and seek to find a minimum length TSP tour that goes through all the regions. We give two approximation algorithms for the case when the regions are allowed to intersect: We give the first O(1)-factor approximation algorithm for intersecting convex fat objects of comparable diameters where we are allowed to hit each object only at a finite set of specified points. The proof follows from two packing lemmas that are of independent interest. For the problem in its most general form (but without the specified points restriction) we give a simple O(logn)-approximation algorithm.
|Title of host publication||Algorithms and Computation |
|Subtitle of host publication||17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006. Proceedings|
|Place of Publication||Berlin|
|Number of pages||10|
|ISBN (Print)||3-540-49694-7, 978-3-540-49694-6|
|Publication status||Published - 2006|
|Name||Lecture Notes in Computer Science|