@InProceedings{deberg_et_al:LIPIcs.ICALP.2016.5,
author = {de Berg, Mark and Buchin, Kevin and Jansen, Bart M. P. and Woeginger, Gerhard},
title = {{Fine-Grained Complexity Analysis of Two Classic TSP Variants}},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
pages = {5:1--5:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-013-2},
ISSN = {1868-8969},
year = {2016},
volume = {55},
editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.5},
URN = {urn:nbn:de:0030-drops-62770},
doi = {10.4230/LIPIcs.ICALP.2016.5},
annote = {Keywords: Traveling salesman problem, fine-grained complexity, bitonic tours, k-opt}
}