An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem

An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem

URL to paper on conference site

Bibliographic Details
Main Authors: Asadpour, Arash, Goemans, Michel X., Madry, Aleksander, Gharan, Shayan Oveis, Saberi, Amin
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Society for Industrial and Applied Mathematics 2011
Online Access:http://hdl.handle.net/1721.1/60990
https://orcid.org/0000-0003-0536-0323
https://orcid.org/0000-0002-0520-1165

Similar Items

Similar Items