Sciweavers

Share
SODA
2010
ACM

An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem

9 years 2 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 30 Jan 2011
Updated 30 Jan 2011
Type Journal
Year 2010
Where SODA
Authors Arash Asadpour, Michel X. Goemans, Aleksander Madry, Shayan Oveis Gharan, Amin Saberi
Comments (0)
books