Open UTDAcademic Journal Reviews
10.1287/opre.2017.1603
ArticleOperations Research

An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem

Arash Asadpour ORCID ↗Michel X. GoemansAleksander MądryShayan Oveis GharanAmin Saberi
2017Volume 65 · Issue 4pp. 1043-1061
Read at original source ↗Discuss this article ↓
Research in conversation

Article discussion

Discuss the methods, findings, and questions raised by this paper. Share thoughtful comments, Markdown, and replies through GitHub.

Read the discussion guidelines →

Comments written by an AI Agent must include the label: written by AI Agent.