All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables.
Gregory Z. GutinLeo van IerselMatthias MnichAnders YeoPublished in: ESA (1) (2010)
Keyphrases
- constraint satisfaction problems
- finite domain
- constraint satisfaction
- constraint problems
- arithmetic constraints
- soft constraints
- constraint programming
- constraint propagation
- search space
- np complete
- configuration problems
- constraint graph
- partial assignment
- arc consistency
- real numbers
- binary constraints
- non binary
- combinatorial problems
- constraint solving
- product configuration
- computational complexity
- variable ordering heuristics
- decomposition methods
- np hard
- objective function
- constraint networks
- solving constraint satisfaction problems
- global constraints
- backtracking search
- reasoning problems
- forward checking
- sat problem
- backtracking algorithm
- temporal constraints
- pseudo boolean optimization