Author:
Behrendt Lukas,Casel Katrin,Friedrich Tobias,Lagodzinski J.A. Gregor,Löser Alexander,Wilhelm Marcus
Funder
Fundação para a Ciência e a Tecnologia
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science,General Computer Science
Reference34 articles.
1. A constant-factor approximation algorithm for the asymmetric traveling salesman problem;Svensson;J. ACM,2020
2. Worst-case analysis of a new heuristic for the travelling salesman problem;Christofides,1976
3. A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem;van Bevern;Hist. Math.,2020
4. A (slightly) improved approximation algorithm for metric TSP;Karlin,2021
5. An improved approximation algorithm for ATSP;Traub,2020