1. Amano, Y., Makino, K.: A 3/4 differential approximation algorithm for traveling salesman problem (2020)
2. Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998)
3. Ausiello, G., Bazgan, C., Demange, M., Paschos, V.T.: Completeness in differential approximation classes. Int. J. Found. Comput. Sci. 16(06), 1267–1295 (2005)
4. Ausiello, G., Paschos, V.T.: Differential ratio approximation. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics: Methologies and Traditional Applications, Volume 1, chap. 15, pp. 259–274. Chapman and Hall/CRC Computer and Information Science, Chapman and Hall/CRC (2018)
5. Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM (JACM) 9(1), 61–63 (1962)