The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems.
Manuel BodirskyZaneta SemanisinováCarsten LutzPublished in: CoRR (2023)
Keyphrases
- constraint satisfaction problems
- np complete
- combinatorial problems
- constraint satisfaction
- solving constraint satisfaction problems
- computational problems
- constraint problems
- search space
- constraint programming
- constraint propagation
- soft constraints
- decomposition methods
- partial constraint satisfaction
- finite domain
- np hard
- reasoning problems
- backtracking search
- pseudo boolean optimization
- graph coloring
- computational complexity
- optimisation problems
- difficult problems
- non binary
- solving problems
- configuration problems
- tractable classes
- worst case
- special case
- disjunctive constraints
- finding optimal solutions
- lower bound
- tractable subclasses
- weighted constraint satisfaction