Sciweavers

Share
SODA
2010
ACM

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

10 years 4 months ago
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.
Arash Asadpour, Michel X. Goemans, Aleksander Madr
Added 01 Mar 2010
Updated 02 Mar 2010
Type Conference
Year 2010
Where SODA
Authors Arash Asadpour, Michel X. Goemans, Aleksander Madry, Shayan Oveis Gharan, Amin Saberi
Comments (0)
books