Optimal-size problem kernels for d-Hitting Set in linear time and space

Original language	English
Article number	105998
Number of pages	9
Journal	Information Processing Letters
Volume	163
DOIs	https://doi.org/10.1016/j.ipl.2020.105998
Publication status	Published - 1 Nov 2020

Combinatorial problems, Data reduction, Kernelization, NP-hard problem, Parameterized complexity

ID: 24765520