On the Kernelization of Global Constraints
IJCAI, pp. 578-584, 2017.
Kernelization is a powerful concept from parameterized complexity theory that captures (a certain idea of) efficient polynomial-time preprocessing for hard decision problems. However, exploiting this technique in the context of constraint programming is challenging. Building on recent results for the VERTEXCOVER constraint, we introduce n...More
PPT (Upload PPT)