A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem (2020)

First Author: Svensson O
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/3424306

Publication URI: http://dx.doi.org/10.1145/3424306

Type: Journal Article/Review

Parent Publication: Journal of the ACM

Issue: 6