4/3-Approximation of Graphic TSP
Data Structures and Algorithms
2024-11-05 v8
Abstract
We describe a -approximation algorithm for the traveling salesman problem in which the distances between points are induced by graph-theoretical distances in an unweighted graph. The algorithm is based on finding a minimum cost perfect matching on the odd degree vertices of a carefully computed 2-edge-connected spanning subgraph.
Cite
@article{arxiv.2305.05411,
title = {4/3-Approximation of Graphic TSP},
author = {Ali Çivril},
journal= {arXiv preprint arXiv:2305.05411},
year = {2024}
}
Comments
Degree reduction and decomposition is all wrong