A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Propagation via Kernelization: The Vertex Cover Constraint
[chapter]
2016
Lecture Notes in Computer Science
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. We study the use of kernelization for designing propagators through the example of the Vertex Cover constraint. Since the classic kernelization rules often
doi:10.1007/978-3-319-44953-1_10
fatcat:bhsywgxelrgqthwlk7or2gsomi