An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem
URL to paper on conference site
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
-
Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time
by: Shang-En Huang, et al.
Published: (2023-05-01) -
Approximating the Log-Partition Function
by: Cosson, Romain
Published: (2022) -
Logging and log management : the authoritative guide to understanding the concepts surrounding logging and log management /
by: Chuvakin, Anton A., author, et al.
Published: (2013) -
Well logging II : electric and acoustic logging/
by: 459028 Jorden, James R., et al.
Published: (1986) -
Log-rank and stratified log-rank tests
by: Ting Ye, et al.
Published: (2023-10-01)