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

We give a constant-factor approximation algorithm for the asymmetric traveling salesman problem (ATSP). Our approximation guarantee is analyzed with respect to the standard LP relaxation, and thus our result confirms the conjectured constant integrality gap of that relaxation. The main idea of our a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of the ACM 2020-11, Vol.67 (6), p.1-53
Hauptverfasser:	Svensson, Ola, Tarnawski, Jakub, Végh, László A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Asymmetry Graphs Mathematical analysis Partitions Reduction Traveling salesman problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!