  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.
