An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem
Name
Goemans_An O.pdf
Size
710.84 KB
Format
Adobe PDF
Checksum (MD5)
6e65c8f456fb3133a8d380428afc7cb2
Author(s)
Asadpour, Arash
Goemans, Michel X.
Madry, Aleksander
Gharan, Shayan Oveis
Saberi, Amin
Date Issued
January 2010
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
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
MIT 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
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.
Persistent DSpace Link
DOI of Published Version
http://www.siam.org/proceedings/soda/2010/SODA10_032_asadpoura.pdf
