14 search results - page 1 / 3 » Improved Approximation Ratios for Traveling Salesperson Tour... |
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
112
Voted
CCCG
2010
15 years 1 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...
116
Voted
SODA
2010
ACM
15 years 9 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...
115
Voted
ESA
2005
Springer
15 years 6 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...
101
Voted
APPROX
2010
Springer
15 years 1 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...