An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem
Author(s)Asadpour, Arash; Goemans, Michel X.; Madry, Aleksander; Gharan, Shayan Oveis; Saberi, Amin
MetadataShow full item record
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.
URL to paper on conference site
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Department of Mathematics
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010
Society for Industrial and Applied Mathematics
Asadpour, Arash, et al. "An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem." Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, Jan. 17-19,2010, Hyatt Regency Austin, Austin, TX. © 2010 SIAM.
Final published version