Emergent Mind

An improved upper bound on the integrality ratio for the $s$-$t$-path TSP

(1808.10734)

Published Aug 31, 2018 in cs.DM , cs.DS , and math.CO

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 $s$-$t$-path TSP.

We're not able to analyze this paper right now due to high demand.

Please check back later (sorry!).

Generate a summary of this paper on our Pro plan:

We ran into a problem analyzing this paper.