Comparing two stochastic local search algorithms for constraint satisfaction problems

Authors:
Uwe Schöning
Affiliations:
Institute of Theoretical Computer Science, University of Ulm, Ulm, Germany
Venue:
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Year:
2010

Citing 3
Cited 0

A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A constructive proof of the Lovász local lemma

Proceedings of the forty-first annual ACM symposium on Theory of computing
Principles of stochastic local search

UC'07 Proceedings of the 6th international conference on Unconventional Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). One is the algorithm used in Moser’s ingenious proof of a constructive version of Lovász Local Lemma [3], the other is the k-SAT random walk algorithm from [5,6], generalized to CSP’s. There are several similarities, both algorithms use a version of stochastic local search (SLS), but the kind of local search neighborhood is defined differently, also the preconditions for the algorithms to work (efficiently) are quite different.