128 search results - page 7 / 26 » On Approximating Multi-Criteria TSP |
116
click to vote
CIAC
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
SODA
2003
ACM
15 years 1 months ago
2003
ACM
80
Voted
JDA
2006
14 years 11 months ago
2006
We consider the asymmetric traveling salesperson problem with -parameterized triangle inequality for [1/2, 1). That means, the edge weights fulfill w(u, v)
SIAMCOMP
2008
14 years 11 months ago
2008
We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...
ESA
1998
Springer
15 years 3 months ago
1998
Springer
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...