Tuesday, 14:15 - 14:40 h, Room: H 3021


Katarzyna Paluch
Simpler approximation of the maximum asymmetric traveling salesman problem

Coauthors: Khaled Elbassioni, Anke van Zuylen


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.


Talk 3 of the invited session Tue.2.H 3021
"Sampling, sorting and graph traversal: Algorithms for finding permutations" [...]
Cluster 2
"Combinatorial optimization" [...]


  In particular, Texas Payday Loans can cater to the needs of its residents. The new drug with unique properties was developed to help men to get rid of all sexual disorders, and its name is Cialis Super Force. Now you do not have to buy two different medications to solve sexual problems.