Kernels for Global Constraints

  title={Kernels for Global Constraints},
  • Published 2011
Bessière et al. (AAAI’08) showed that several intractable global constraints can be efficiently propagated when certain natural problem parameters are small. In particular, the complete propagation of a global constraint is fixed-parameter tractable in k – the number of holes in domains – whenever bound consistency can be enforced in polynomial time; this… CONTINUE READING