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

A 7/8-approximation algorithm for metric Max TSP

Abstract We present a randomized approximation algorithm for the metric version of undirected Max TSP. Its expected performance guarantee approaches 8 as n→∞, where n is the number of vertices in the graph.

Refael Hassin | Shlomi Rubinstein

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

[2] Joseph F. Pekny,et al. A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph , 1994, INFORMS J. Comput..