Author:
Casteigts Arnaud,Raffinot Mathieu,Schoeters Jason
Publisher
Springer International Publishing
Reference27 articles.
1. Applegate, D., Bixby, R., Chvatal, V., Cook, W.: Concorde TSP solver (2006)
2. Arkin, E.M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Appl. Math. 55(3), 197–218 (1994)
3. Arora, S.: Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In: Proceedings of 37th Conference on Foundations of Computer Science, pp. 2–11. IEEE (1996)
4. Bekos, M.A., Bruckdorfer, T., Förster, H., Kaufmann, M., Poschenrieder, S., Stüber, T.: Algorithms and insights for racetrack. Theoret. Comput. Sci. 748, 2–16 (2018)
5. Bjorklund, A.: Determinant sums for undirected Hamiltonicity. SIAM J. Comput. 43(1), 280–299 (2014)