TY - JOUR
T1 - A 5/8 approximation algorithm for the maximum asymmetric TSP
AU - Lewenstein, Moshe
AU - Sviridenko, Maxim
PY - 2003/11
Y1 - 2003/11
N2 - The maximum asymmetric traveling salesperson problem, also known as the taxicab rip-off problem, is the problem of finding a maximally weighted tour in a complete asymmetric graph with nonnegative weights. 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 linear programming formulation. Previous solutions were combinatorial. We make use of the linear programming in a novel manner and strengthen the path-coloring method originally proposed in [S. R. Kosaraju, J. K. Park, and C. Stein, Long tours and short superstrings, in Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994, pp. 166-177].
AB - The maximum asymmetric traveling salesperson problem, also known as the taxicab rip-off problem, is the problem of finding a maximally weighted tour in a complete asymmetric graph with nonnegative weights. 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 linear programming formulation. Previous solutions were combinatorial. We make use of the linear programming in a novel manner and strengthen the path-coloring method originally proposed in [S. R. Kosaraju, J. K. Park, and C. Stein, Long tours and short superstrings, in Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994, pp. 166-177].
KW - Approximation algorithms
KW - Graph theory
KW - Linear programming
KW - Traveling salesperson
UR - http://www.scopus.com/inward/record.url?scp=2542485737&partnerID=8YFLogxK
U2 - 10.1137/s0895480102402861
DO - 10.1137/s0895480102402861
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:2542485737
SN - 0895-4801
VL - 17
SP - 237
EP - 248
JO - SIAM Journal on Discrete Mathematics
JF - SIAM Journal on Discrete Mathematics
IS - 2
ER -