论文信息 - Better approximations for max TSP

Better approximations for max TSP

We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected value of at least r times the optimal one for any given r<25/33 .

Refael Hassin | Shlomi Rubinstein | Refael Hassin | S. Rubinstein | Shlomi Rubinstein

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

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

[3] Rajeev Motwani,et al. Approximating Capacitated Routing and Delivery Problems , 1999, SIAM J. Comput..