Dynamic algorithms for classes of constraint satisfaction problems

DOI10.1016/S0304-3975(00)00013-XzbMath0973.68216OpenAlexW2027202791MaRDI QIDQ5941281

Alberto Marchetti-Spaccamela, Umberto Nanni, Daniele Frigioni

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00013-x

zbMATH Keywords

consistencyamortized complexitybacktrack-free searchconstraint satisfaction problemdynamic algorithmsnetwork of constraints

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Network-based heuristics for constraint-satisfaction problems
• Consistency in networks of relations
• Fast parallel constraint satisfaction
• Networks of constraints: Fundamental properties and applications to picture processing
• Constraint relaxation may be perfect
• Amortized Computational Complexity
• Minimal Representation of Directed Hypergraphs
• A sufficient condition for backtrack-bounded search
• A Sufficient Condition for Backtrack-Free Search
• Synthesizing constraint expressions
• Approximation of Constraint Satisfaction via local search

This page was built for publication: Dynamic algorithms for classes of constraint satisfaction problems