@InProceedings{bonnet_et_al:LIPIcs.ESA.2019.23,
author = {Bonnet, \'{E}douard and Iwata, Yoichi and Jansen, Bart M. P. and Kowalik, {\L}ukasz},
title = {{Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP}},
booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)},
pages = {23:1--23:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-124-5},
ISSN = {1868-8969},
year = {2019},
volume = {144},
editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.23},
URN = {urn:nbn:de:0030-drops-111444},
doi = {10.4230/LIPIcs.ESA.2019.23},
annote = {Keywords: traveling salesman problem, k-OPT, bounded degree}
}