title: [Formula: see text]-Approximation for Graphic TSP.
abstract: The Travelling Salesman Problem is one of the fundamental and intensively studied problems in approximation algorithms. For more than 30 years, the best algorithm known for general metrics has been Christofides's algorithm with an approximation factor of [Formula: see text], even though the so-called Held-Karp LP relaxation of the problem is conjectured to have the integrality gap of only [Formula: see text]. Very recently, significant progress has been made for the important special case of graphic metrics, first by Oveis Gharan et al. (FOCS, 550-559, 2011), and then by Mömke and Svensson (FOCS, 560-569, 2011). In this paper, we provide an improved analysis of the approach presented in Mömke and Svensson (FOCS, 560-569, 2011) yielding a bound of [Formula: see text] on the approximation factor, as well as a bound of [Formula: see text] for anyε>0 for a more general Travelling Salesman Path Problem in graphic metrics.
authors: Faculty of Mathematics, Informatics, and Mechanics, University of Warsaw, ul. Banacha 2, 02-097 Warszawa, Poland.
authors: Marcin
authors: M
authors: Mucha
keywords: Approximation algorithms; Travelling salesman problem