1. Asadpour, A., Goemans, M.X., Mądry, A., Gharan, S.O., Saberi, A.: An $$O$$(log $$n$$/log log $$n$$)-approximation algorithm for the asymmetric traveling salesman problem. Oper. Res. 65, 1043–1061 (2017)
2. Boyd, S., Sebő, A.: The salesman’s improved tours for fundamental classes. Math. Program. 186, 289–307 (2021)
3. Christofides, N.: Worst case analysis of a new heuristic for the traveling salesman problem. Report 388. Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh (1976)
4. Cornuejols, G., Nemhauser, G.L.: Tight bounds for Christofides’ traveling salesman heuristic. Math. Program. 14, 116–121 (1978)
5. Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problem. J. Oper. Res. Soc. Am. 2(4), 393–410 (1954)