License
when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2012.30
URN: urn:nbn:de:0030-drops-34025
URL: http://drops.dagstuhl.de/opus/volltexte/2012/3402/

Mucha, Marcin

13/9-approximation for Graphic TSP

pdf-format:
Dokument 1.pdf (587 KB)


Abstract

The Travelling Salesman Problem is one of the most fundamental and most studied problems in approximation algorithms. For more than 30 years, the best algorithm known for general metrics has been Christofides's algorithm with approximation factor of 3/2, even though the so-called Held-Karp LP relaxation of the problem is conjectured to have the integrality gap of only 4/3. Very recently, significant progress has been made for the important special case of graphic metrics, first by Oveis Gharan et al. (2011), and then by Momke and Svensson (2011). In this paper, we provide an improved analysis of the approach used by the latter, yielding a bound of 13/9 on the approximation factor, as well as a bound of 19/12+epsilon for any epsilon>0 for a more general Travelling Salesman Path Problem in graphic metrics.

BibTeX - Entry

@InProceedings{mucha:LIPIcs:2012:3402,
  author =	{Marcin Mucha},
  title =	{{13/9-approximation for Graphic TSP}},
  booktitle =	{29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
  pages =	{30--41},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-35-4},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{14},
  editor =	{Christoph D{\"u}rr and Thomas Wilke},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2012/3402},
  URN =		{urn:nbn:de:0030-drops-34025},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.STACS.2012.30},
  annote =	{Keywords: approximation algorithms, travelling salesman problem}
}

Keywords: approximation algorithms, travelling salesman problem
Seminar: 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
Issue date: 2012
Date of publication: 24.02.2012


DROPS-Home | Fulltext Search | Imprint Published by LZI