Author:
Balkanski Eric,Faenza Yuri,Kubik Mathieu
Publisher
Springer International Publishing
Reference33 articles.
1. Antoniadis, A., Fleszar, K., Hoeksma, R., Schewior, K.: A PTAS for Euclidean TSP with hyperplane neighborhoods. In: SODA, pp. 1089–1105. SIAM (2019)
2. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem. Princeton University Press (2011)
3. Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM (JACM) 45(5), 753–782 (1998)
4. Arthur, D., Vassilvitskii, S.: Worst-case and smoothed analysis of the ICP algorithm, with an application to the k-means method. In: FOCS, pp. 153–164. IEEE (2006)
5. Asadpour, A., Goemans, M.X., Madry, A., Gharan, S.O., Saberi, A.: An $${O} (\log n/\log \log n)$$-approximation algorithm for the asymmetric traveling salesman problem. Oper. Res. 65(4), 1043–1061 (2017)