A randomized approximation algorithm for the metric version of undirected maximum traveling salesman problem (Max TSP) was presented. The expected performance guarantee of the algorithm approached 7/8 as n approached infinity, where n indicates the number of vertices in the graph. The problem of computing a binary 2-matching of maximum weight was computed and the related theorems were proved. A review of the Serdyukov's algorithm and the algorithm of Kostochka and Serdyukov was also presented.
- Analysis of algorithms
- Maximum traveling salesman problem