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