Yiannis Giannakopoulos, Alexander Grosz, Themistoklis Melissourgos. On the Smoothed Complexity of Combinatorial Local Search. In Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, editors, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia. Volume 297 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. [doi]
@inproceedings{GiannakopoulosG24,
title = {On the Smoothed Complexity of Combinatorial Local Search},
author = {Yiannis Giannakopoulos and Alexander Grosz and Themistoklis Melissourgos},
year = {2024},
doi = {10.4230/LIPIcs.ICALP.2024.72},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2024.72},
researchr = {https://researchr.org/publication/GiannakopoulosG24},
cites = {0},
citedby = {0},
booktitle = {51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia},
editor = {Karl Bringmann and Martin Grohe and Gabriele Puppis and Ola Svensson},
volume = {297},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-322-5},
}