Highly Influenced

@inproceedings{Elbassioni2006OnAT, title={On Approximating the TSP with Intersecting Neighborhoods}, author={Khaled M. Elbassioni and Aleksei V. Fishkin and Ren{\'e} Sitters}, booktitle={ISAAC}, year={2006} }

- Published 2006 in ISAAC
DOI:10.1007/11940128_23

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… CONTINUE READING

Highly Cited

This paper has 25 citations. REVIEW CITATIONS