A 7/8-approximation algorithm for metric max TSP
We present a randomized approximation algorithm for the metric version of undirected Max TSP. Its expected performance 7/8 as n --> infinity, where n is the number of vertices in the graph. (C) 2002 Elsevier Science B.V. All rights guarantee reserved.
analysis of algorithms maximum traveling salesman problem