22 search results - page 2 / 5 » Asymmetric Traveling Salesman Path and Directed Latency Prob... |
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...
117
click to vote
ENDM
2010
14 years 11 months ago
2010
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
105
Voted
CAAN
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heu...
DISOPT
2006
14 years 11 months ago
2006
This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will o...
ALGORITHMICA
2005
14 years 11 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...