| dc.contributor.author | Asadpour, Arash | |
| dc.contributor.author | Goemans, Michel X. | |
| dc.contributor.author | Madry, Aleksander | |
| dc.contributor.author | Gharan, Shayan Oveis | |
| dc.contributor.author | Saberi, Amin | |
| dc.date.accessioned | 2011-02-18T19:51:40Z | |
| dc.date.available | 2011-02-18T19:51:40Z | |
| dc.date.issued | 2010-01 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/60990 | |
| dc.description | URL to paper on conference site | en_US |
| dc.description.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. | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (Fulbright Science and Technology Award, contract CCF- 0829878) | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (contract CCF- 0829878) | en_US |
| dc.description.sponsorship | United States. Office of Naval Research (ONR grant N00014-05-1-0148) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Society for Industrial and Applied Mathematics | en_US |
| dc.relation.isversionof | http://www.siam.org/proceedings/soda/2010/SODA10_032_asadpoura.pdf | en_US |
| dc.rights | 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. | en_US |
| dc.source | SIAM | en_US |
| dc.title | An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem | en_US |
| dc.type | Article | en_US |
| dc.identifier.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. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
| dc.contributor.approver | Goemans, Michel X. | |
| dc.contributor.mitauthor | Goemans, Michel X. | |
| dc.contributor.mitauthor | Madry, Aleksander | |
| dc.relation.journal | Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010 | en_US |
| dc.eprint.version | Final published version | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| dspace.orderedauthors | Asadpour, Arash; Goemans, Michel X.; Madry, Aleksander; Gharan, Shayan Oveis; Saberi, Amin | |
| dc.identifier.orcid | https://orcid.org/0000-0003-0536-0323 | |
| dc.identifier.orcid | https://orcid.org/0000-0002-0520-1165 | |
| mit.license | PUBLISHER_POLICY | en_US |
| mit.metadata.status | Complete | |
