Cargando…
[Formula: see text]-Approximation for Graphic TSP
The Travelling Salesman Problem is one of the fundamental and intensively studied problems in approximation algorithms. For more than 30 years, the best algorithm known for general metrics has been Christofides’s algorithm with an approximation factor of [Formula: see text], even though the so-calle...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2012
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4538985/ https://www.ncbi.nlm.nih.gov/pubmed/26300685 http://dx.doi.org/10.1007/s00224-012-9439-7 |