Parameterized Algorithms for HITTING SET: The Weighted Case

摘要

We are going to analyze simple search tree algorithms for WEIGHTED d-HITTING SET. Although the algorithms are simple, their analysis is technically rather involved. However, this approach allows us to even improve on elsewhere published algorithm running time estimates for the more restricted case of (unweighted) d-HITTING SET.