Focused Stochastic Local Search and the Lov\'asz Local Lemma
Discrete Mathematics
2015-08-18 v2 Combinatorics
Probability
Abstract
We develop tools for analyzing focused stochastic local search algorithms. These are algorithms which search a state space probabilistically by repeatedly selecting a constraint that is violated in the current state and moving to a random nearby state which, hopefully, addresses the violation without introducing many new ones. A large class of such algorithms arise from the algorithmization of the Lov\'asz Local Lemma, a non-constructive tool for proving the existence of satisfying states. Here we give tools that provide a unified analysis of such algorithms and of many more, expressing them as instances of a general framework.
Keywords
Cite
@article{arxiv.1507.07633,
title = {Focused Stochastic Local Search and the Lov\'asz Local Lemma},
author = {Dimitris Achlioptas and Fotis Iliopoulos},
journal= {arXiv preprint arXiv:1507.07633},
year = {2015}
}
Comments
Generalized the analysis of the Recursive Walk algorithm; corrected the proof of Acyclic Edge Coloring result