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

03/10/2020

∙

by   René van Bevern, et al.

∙

0

∙

share

We improve two linear-time data reduction algorithms for the d-Hitting Set problem to work in linear space, thus obtaining the first algorithms for computing problem kernels of asymptotically optimal size O(k^d) for d-Hitting Set in linear time and space. We experimentally compare the two algorithms to a classical data reduction algorithm of Weihe and evaluate their combinations.