14 search results - page 1 / 3 » Improved Approximation Ratios for Traveling Salesperson Tour... |
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
CCCG
2010
13 years 6 months ago
2010
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...