A 7/8-approximation algorithm for metric Max TSP

Refael Hassin*, Shlomi Rubinstein

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

33 Scopus citations


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.

Original languageEnglish
Pages (from-to)247-251
Number of pages5
JournalInformation Processing Letters
Issue number5
StatePublished - 16 Mar 2002


  • Analysis of algorithms
  • Maximum traveling salesman problem


Dive into the research topics of 'A 7/8-approximation algorithm for metric Max TSP'. Together they form a unique fingerprint.

Cite this