Automatic Generation of Music Programs
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Filtering Algorithms for the NValue Constraint
Constraints
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Invitation to data reduction and problem kernelization
ACM SIGACT News
Infeasibility of instance compression and succinct PCPs for NP
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The complexity of global constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
The parameterized complexity of global constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
On problems without polynomial kernels
Journal of Computer and System Sciences
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Exact Exponential Algorithms
The lost continent of polynomial time: preprocessing and kernelization
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Parameterized Complexity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
On the complexity of global scheduling constraints under structural restrictions
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
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 applies to the global constraints ATMOST-NVALUE and EXTENDED GLOBAL CARDINALITY (EGC). In this paper we extend this line of research and introduce the concept of reduction to a problem kernel, a key concept of parameterized complexity, to the field of global constraints. In particular, we show that the consistency problem for ATMOST-NVALUE constraints admits a linear time reduction to an equivalent instance on O(k2) variables and domain values. This small kernel can be used to speed up the complete propagation of NVALUE constraints. We contrast this result by showing that the consistency problem for EGC constraints does not admit a reduction to a polynomial problem kernel unless the polynomial hierarchy collapses.