4/3-Approximation of Graphic TSP
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917827839000576 |
|---|---|
| author | Çivril, Ali |
| author_facet | Çivril, Ali |
| contents | We describe a $\frac{4}{3}$-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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_05411 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | 4/3-Approximation of Graphic TSP Çivril, Ali Data Structures and Algorithms We describe a $\frac{4}{3}$-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. |
| title | 4/3-Approximation of Graphic TSP |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2305.05411 |