@inproceedings{DBLP:conf/icalp/Heimann0H24,
 author = {Sophia Heimann and
Hung P. Hoang and
Stefan Hougardy},
 bibsource = {dblp computer science bibliography, https://dblp.org},
 biburl = {https://dblp.org/rec/conf/icalp/Heimann0H24.bib},
 booktitle = {51st International Colloquium on Automata, Languages, and Programming,
{ICALP} 2024, July 8-12, 2024, Tallinn, Estonia},
 doi = {10.4230/LIPICS.ICALP.2024.84},
 editor = {Karl Bringmann and
Martin Grohe and
Gabriele Puppis and
Ola Svensson},
 keywords = {ParAI},
 pages = {84:1--84:18},
 publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{ü}r Informatik},
 series = {LIPIcs},
 timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
 title = {The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential
Running Time for k {\(\geq\)} 5},
 url = {https://doi.org/10.4230/LIPIcs.ICALP.2024.84},
 volume = {297},
 year = {2024}
}