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
Thumbnail
DownloadGoemans_An O.pdf (710.8Kb)
PUBLISHER_POLICY
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
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.
Description
URL to paper on conference site
Date issued
2010-01
URI
http://hdl.handle.net/1721.1/60990
Department
Massachusetts 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
Journal
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010
Publisher
Society for Industrial and Applied Mathematics
Citation
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.
Version: Final published version
Collections