Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem

Katarzyna Paluch, Khaled Elbassioni, Anke Van Zuylen, Marc Herbstritt
2012 Symposium on Theoretical Aspects of Computer Science  
We give a very simple approximation algorithm for the maximum asymmetric traveling salesman problem. The approximation guarantee of our algorithm is 2/3, which matches the best known approximation guarantee by Kaplan, Lewenstein, Shafrir and Sviridenko. Our algorithm is simple to analyze, and contrary to previous approaches, which need an optimal solution to a linear program, our algorithm is combinatorial and only uses maximum weight perfect matching algorithm. ACM Subject Classification I.1.2
more » ... Algorithms Keywords and phrases approximation algorithm, maximum asymmetric traveling salesman problem
doi:10.4230/lipics.stacs.2012.501 dblp:conf/stacs/PaluchEZ12 fatcat:2yn5oyiy6vhcvkfoup6nznr5sy