@InProceedings{cygan_et_al:LIPIcs.ESA.2017.30,
  author =	{Cygan, Marek and Kowalik, Lukasz and Socala, Arkadiusz},
  title =	{{Improving TSP Tours Using Dynamic Programming over Tree Decompositions}},
  booktitle =	{25th Annual European Symposium on Algorithms (ESA 2017)},
  pages =	{30:1--30:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-049-1},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{87},
  editor =	{Pruhs, Kirk and Sohler, Christian},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.30},
  URN =		{urn:nbn:de:0030-drops-78539},
  doi =		{10.4230/LIPIcs.ESA.2017.30},
  annote =	{Keywords: TSP, treewidth, local search, XP algorithm, hardness in P}
}