Skip to main content
Article thumbnail
Location of Repository

Survey Propagation: Iterative Solutions to Constraint Satisfaction Problems

By Constantine Caramanis


Iterative algorithms, such as the well known Belief Propagation algorithm, have had much success in solving problems in statistical inference and coding and information theory. Survey Propagation attempts to apply iterative message passing algorithms to solve difficult combinatorial problems, in particular constraint satisfaction problems such as k-sat and coloring problems. Intuition from statistical physics, involving evidence of phase transitions and clustering phenomena in the solution space, motivate some key modifications to well-known message passing algorithms, to yield effective tools for large instances of constraint satisfaction problems. The main algorithm, Survey Propagation, is motivated and developed, and then realized as a Belief Propagation algorithm, with an addition of a joker state.

Year: 2003
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.