Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem

@inproceedings{Paluch2012SimplerAO,
  title={Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem},
  author={Katarzyna E. Paluch and Khaled M. Elbassioni and Anke van Zuylen},
  booktitle={STACS},
  year={2012}
}
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. 1998 ACM Subject Classification… CONTINUE READING
13 Citations
11 References
Similar Papers

Similar Papers

Loading similar papers…