论文信息 - Improved deterministic approximation algorithms for Max TSP

Improved deterministic approximation algorithms for Max TSP

We present an O(n3)-time approximation algorithm for the maximum traveling salesman problem whose approximation ratio is asymptotically 61/81 where n is the number of vertices in the input complete edge-weighted (undirected) graph. We also present an O(n3)-time approximation algorithm for the metric case of the problem whose approximation ratio is asymptotically 17/20. Both algorithms improve on the previous bests.

[1] Zhi-Zhong Chen. Parallel Constructions of Maximal Path Sets and Applications to Short Superstrings , 1996, Theor. Comput. Sci..

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

[3] Eli Upfal,et al. Constructing a perfect matching is in random NC , 1985, STOC '85.

[4] Refael Hassin,et al. An Approximation Algorithm for the Maximum Traveling Salesman Problem , 1998, Inf. Process. Lett..

[5] Zhi-Zhong Chen,et al. An Improved Randomized Approximation Algorithm for Max TSP , 2005, J. Comb. Optim..

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

[7] Vijay V. Vazirani,et al. Matching is as easy as matrix inversion , 1987, STOC.

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