论文信息 - A 7/8-approximation algorithm for metric Max TSP

A 7/8-approximation algorithm for metric Max TSP

We present a randomized approximation algorithm for the metric undirected MAXIMUM TRAVELING SALESMAN PROBLEM. Its expected performance guarantee approaches 7/8 as n → 8, where n is the number of vertices in the graph.

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

[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..