Better approximations for max TSP

Refael Hassin, Shlomi Rubinstein

Research output: Contribution to journalArticlepeer-review


Two known polynomial time approximation algorithms for the maximum traveling salesman problem (TSP) are combined to obtain a randomized algorithm which outputs a solution with expected value of at least r times the optimal one for any given r<25/33. Serdyukov's algorithm is first describe and then combine the polynomial time approximation. The results are then applied to obtain new approximation results for the maximum latency TSP.

Original languageEnglish
Pages (from-to)181-186
Number of pages6
JournalInformation Processing Letters
Issue number4
StatePublished - 30 Sep 2000


Dive into the research topics of 'Better approximations for max TSP'. Together they form a unique fingerprint.

Cite this