Approximating asymmetric maximum TSP

Moshe Lewenstein, Maxim Sviridenko

Research output: Contribution to conferencePaperpeer-review

8 Scopus citations


The asymmetric maximim traveling salesman problem, also known as the Taxicab Ripoff problem, is the problem of finding a maximally weighted tour in a complete asymmetric graph with non-negative weights. Interesting in its own right, this problem is also motivated by such problems such as the shortest superstring problem. We propose a polynomial time approximation algorithm for the problem with a 5/8 approximation guarantee. This (1) improves upon the approximation factors of previous results and (2) presents a simpler solution to the previously fairly involved algorithms. Our solution uses a simple LP formulation. Previous solutions where combinatorial. We make use of the LP in a novel manner and strengthen the Path-Coloring method originally proposed in [13].

Original languageEnglish
Number of pages9
StatePublished - 2003
EventConfiguralble Computing: Technology and Applications - Boston, MA, United States
Duration: 2 Nov 19983 Nov 1998


ConferenceConfiguralble Computing: Technology and Applications
Country/TerritoryUnited States
CityBoston, MA


Dive into the research topics of 'Approximating asymmetric maximum TSP'. Together they form a unique fingerprint.

Cite this