✦ LIBER ✦

Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable

✍ Scribed by Fellows, Michael; Friedrich, Tobias; Hermelin, Danny; Narodytska, Nina; Rosamond, Frances

Book ID: 122082659
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 238 KB
Volume: 472
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.11.038

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new tractable class of constraint sati

A new tractable class of constraint satisfaction problems

✍ Víctor Dalmau 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 340 KB

Tractable Structures for Constraint Sati

Tractable Structures for Constraint Satisfaction with

✍ Dániel Marx 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 497 KB

Decision-making Process || Constraint Sa

Decision-making Process || Constraint Satisfaction Problems

✍ Bouyssou, Denis; Dubois, Didier; Pirlot, Marc; Prade, Henri 📂 Article 📅 2009 🏛 ISTE ⚖ 479 KB

Constraint satisfaction over connected r

Constraint satisfaction over connected row-convex constraints

✍ Yves Deville; Olivier Barette; Pascal Van Hentenryck 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 431 KB

This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition, the basic operations of path-consistency algorithms. This establishes that path consistency over CRC constraints produc

Compiling constraint satisfaction proble

Compiling constraint satisfaction problems

✍ Rainer Weigel; Boi Faltings 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 682 KB

Full Constraint Satisfaction Problems

✍ Feder, Tomás; Hell, Pavol 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 225 KB