An improved upper bound on the integrality ratio for the $s$-$t$-path TSP
Discrete Mathematics
2019-07-24 v2 Data Structures and Algorithms
Combinatorics
Abstract
We give an improved analysis of the best-of-many Christofides algorithm with lonely edge deletion, which was proposed by Seb\H{o} and van Zuylen [2016]. This implies an improved upper bound on the integrality ratio of the standard LP relaxation for the --path TSP.
Cite
@article{arxiv.1808.10734,
title = {An improved upper bound on the integrality ratio for the $s$-$t$-path TSP},
author = {Vera Traub and Jens Vygen},
journal= {arXiv preprint arXiv:1808.10734},
year = {2019}
}