Voltar
Capítulo de livro Revisado por pares
BIBTEX RIS

On Approximating the TSP with Intersecting Neighborhoods

2006; Springer Science+Business Media; Linguagem: Inglês

10.1007/11940128_23

ISSN

1611-3349

Autores

Khaled Elbassioni, Aleksei V. Fishkin, René Sitters,

Tópico(s)

Advanced Graph Theory Research

Resumo

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.

Referência(s)