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

From MaRDI portal
Publication:5360842

DOI10.1287/opre.2017.1603zbMath1380.90229OpenAlexW2620774153WikidataQ94086899 ScholiaQ94086899MaRDI QIDQ5360842

Michel X. Goemans, Arash Asadpour, Amin Saberi, Shayan Oveis Gharan, Aleksander Mądry

Publication date: 26 September 2017

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2017.1603




Related Items (14)




This page was built for publication: An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem