ACM Symposium on Theory of Computing, STOC 2018


Article Details
Title: A constant-factor approximation algorithm for the asymmetric traveling salesman problem
Article URLs:
Alternative Article URLs:
Authors: Ola Svensson
  • EPFL
Jakub Tarnawski
  • EPFL
László A. Végh
  • London School of Economics
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/SvenssonTV18
Author Comments:

Discuss this paper and its artifacts below