On the Smoothed Complexity of Combinatorial Local Search

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]

Authors

Yiannis Giannakopoulos

This author has not been identified. Look up 'Yiannis Giannakopoulos' in Google

Alexander Grosz

This author has not been identified. Look up 'Alexander Grosz' in Google

Themistoklis Melissourgos

This author has not been identified. Look up 'Themistoklis Melissourgos' in Google