We are going to analyze search tree algorithms for Weighted-Hitting Set. Although the algorithms that we develop are fairly simple, their analysis is technically involved. We compare the weighted case with the previously analyzed unweighted one, exhibiting that the advantage of the unweighted case dwindles with growing .
This is a full version of the paper presented in Fernau (2006) [8]. Most of the work on this material has been done while the author was with Univ. Tübingen, Germany, as well as with Univ. Hertfordshire, Hatfield, UK. The according support is gratefully acknowledged.
