The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem
From MaRDI portal
Publication:6350626
arXiv2010.02583MaRDI QIDQ6350626
Stefan Hougardy, Unnamed Author
Publication date: 6 October 2020
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Approximation algorithms (68W25)
This page was built for publication: The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem