An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem

We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(log n/ log log n) of the optimum with high probability.

• Type: Conference
• Year: 2010
• Where: SODA
• Authors: Arash Asadpour, Michel X. Goemans, Aleksander Madry, Shayan Oveis Gharan, Amin Saberi
• Keywords: Asymmetric Traveling Salesman, Discrete Algorithms, Log N, Randomized Algorithm, SODA 2010