论文信息 - 35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality

35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality

We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 which improves on the previous 31/40 factor of Bläser, Ram and Sviridenko (Lecture Notes in Computer Science, vol. 3122, pp. 350–359, 2005).

Marcin Mucha | Lukasz Kowalik

[1] Alexandr V. Kostochka,et al. Polynomial algorithms with the estimates $frac 34$ and $frac 56$ for the traveling salesman problem of the maximum , 1985 .

[2] Refael Hassin,et al. Better approximations for max TSP , 2000, Inf. Process. Lett..

[3] Bodo Manthey,et al. Two Approximation Algorithms for 3-Cycle Covers , 2002, APPROX.

[4] Moshe Lewenstein,et al. A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP , 2004, SIAM J. Discret. Math..

[5] Refael Hassin,et al. A 7/8-approximation algorithm for metric Max TSP , 2001, Inf. Process. Lett..

[6] Markus Bläser,et al. Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems , 2009, Oper. Res. Lett..

[7] Markus Bläser,et al. An 8/13-approximation algorithm for the asymmetric maximum TSP , 2002, SODA '02.

[8] Zhi-Zhong Chen,et al. Improved Approximation Algorithms for Metric Max TSP , 2005, ESA.

[9] Moshe Lewenstein,et al. Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs , 2005, JACM.

[10] Clifford Stein,et al. Long Tours and Short Superstrings (Preliminary Version) , 1994, FOCS 1994.