A constant-factor approximation algorithm for the asymmetric traveling salesman problem (2018)
Attributed to:
New strongly polynomial algorithms for network optimisation problems
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1145/3188745.3188824
Publication URI: http://dx.doi.org/10.1145/3188745.3188824
Type: Conference/Paper/Proceeding/Abstract