Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem

Katarzyna Paluch , Khaled Elbassioni (1) , Anke van Zuylen

1 MPII - Max-Planck-Institut für Informatik

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.

Mots clés: approximation algorithm; maximum asymmetric traveling salesman problem

Domaines: Complexité [cs.CC]; Algorithme et structure de données [cs.DS]

Katarzyna Paluch, Khaled Elbassioni, Anke van Zuylen. Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem. STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.501-506. ⟨hal-00678183⟩