no code implementations • 7 Feb 2017 • Clément Carbonnel, Emmanuel Hébrard
The technique of kernelization consists in extracting, from an instance of a problem, an essentially equivalent instance whose size is bounded in a parameter k. Besides being the basis for efficient param-eterized algorithms, this method also provides a wealth of information to reason about in the context of constraint programming.
no code implementations • 23 Jan 2017 • Emmanuel Hébrard, Marie-José Huguet, Daniel Veysseire, Ludivine Sauvan, Bertrand Cabon
This can be modeled as packing the tests into configurations, and we introduce a set of implied constraints to improve the lower bound of the model.
