11 search results - page 1 / 3 » A new approximation algorithm for the asymmetric TSP with tr... |
101
click to vote
WADS
2007
Springer
15 years 4 months ago
2007
Springer
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
SODA
2003
ACM
15 years 2 days ago
2003
ACM
JDA
2006
14 years 10 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)
STACS
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
APPROX
2008
Springer
15 years 22 days ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...