330 search results - page 1 / 66 » Approximation Algorithms for the Directed k-Tour and k-Strol... |
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...
63
Voted
APPROX
2007
Springer
15 years 5 months ago
2007
Springer
68
Voted
ICALP
2003
Springer
15 years 4 months ago
2003
Springer
STOC
2007
ACM
15 years 11 months ago
2007
ACM
111
click to vote
ICALP
2011
Springer
14 years 2 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...