A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics

  • T-H. Hubert Chana, Khaled Elbassionib
  • Published 2009


We consider the Traveling Salesman Problem with Neighborhoods (TSPN) in doubling metrics. The goal is to find a shortest tour that visits each of a collection of n subsets (regions or neighborhoods) in the underlying metric space. We give a QPTAS when the regions are what we call α-fat weakly disjoint. This notion combines the existing notions of diameter… (More)


1 Figure or Table

Slides referencing similar topics