Corpus ID: 212644672

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

@article{Bevern2020OptimalsizePK,
  title={Optimal-size problem kernels for d-Hitting Set in linear time and space},
  author={Ren'e van Bevern and Pavel V. Smirnov},
  journal={ArXiv},
  year={2020},
  volume={abs/2003.04578}
}
  • Ren'e van Bevern, Pavel V. Smirnov
  • Published in ArXiv 2020
  • Mathematics, Computer Science
  • 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. 

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 32 REFERENCES

    A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Towards Optimal and Expressive Kernelization for d-Hitting Set

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Computing Hitting Set Kernels By AC0-Circuits

    VIEW 1 EXCERPT

    Dynamic Kernels for Hitting Sets and Set Packing

    VIEW 1 EXCERPT

    Strong inconsistency

    VIEW 1 EXCERPT