Abstract
Based on the methodology we presented in earlier work on parameterized algorithms for 3-Hitting Set, we develop simple search tree-based algorithms for d-Hitting Set. We considerably improve on the bounds that were elsewhere derived for these problems.
Acknowledgements
We thank the referees for their scholastic labours.
Notes
Some doubts concerning the validity of this result are discussed on the homepage of Wahlström.
The values computed this way will also satisfy other assumptions made above, as for example EquationEquation (8).
As suggested by one of the referees.