Constraint Satisfaction Problems of Bounded Width

13 years 11 months ago

Download www.karlin.mff.cuni.cz

We provide a full characterization of applicability of The Local Consistency Checking algorithm to solving the non-uniform Constraint Satisfaction Problems. This settles the conjecture of Larose and Z´adori.

Libor Barto, Marcin Kozik

Real-time Traffic

Consistency Checking Algorithm | FOCS 2009 | Larose | Non-uniform Constraint Satisfaction | Theoretical Computer Science |

claim paper

» Bounded TreeWidth and CSPRelated Problems

» Parallel and distributed algorithms for finite constraint satisfaction problems

» Approximating fractional hypertree width

» Constraint satisfaction a personal perspective

» A unified theory of structural tractability for constraint satisfaction problems

» The Linear Programming Polytope of Binary Constraint Problems with Bounded TreeWidth

» New Structural Decomposition Techniques for Constraint Satisfaction Problems

» An Evolutionary Constraint Satisfaction Solution for over the Cell Channel Routing

Post Info
More Details (n/a)

Added	20 May 2010
Updated	20 May 2010
Type	Conference
Year	2009
Where	FOCS
Authors	Libor Barto, Marcin Kozik

Comments (0)

Sciweavers

Constraint Satisfaction Problems of Bounded Width

Consistency Checking Algorithm | FOCS 2009 | Larose | Non-uniform Constraint Satisfaction | Theoretical Computer Science |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers