An improved upper bound on the integrality ratio for the s-t-path TSP
Abstract
We give an improved analysis of the best-of-many Christofides algorithm with lonely edge deletion, which was proposed by Sebo 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.