2000 character limit reached
An improved upper bound on the integrality ratio for the $s$-$t$-path TSP (1808.10734v2)
Published 31 Aug 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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.