TY - JOUR

T1 - Approximating asymmetric maximum TSP

AU - Lewenstein, Moshe

AU - Sviridenko, Maxim

PY - 2003/1/1

Y1 - 2003/1/1

N2 - 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].

AB - 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].

UR - http://www.scopus.com/inward/record.url?scp=38416004&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

JO - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

JF - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

ER -