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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have