Focused Stochastic Local Search and the Lovász Local Lemma.
SODA '16: Symposium on Discrete Algorithms Arlington Virginia January, 2016(2016)
摘要
We develop tools for analyzing focused stochastic local search algorithms. These are algorithms that 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 algorithmizations of the Lovász 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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络