Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR06-072 | 25th February 2006 00:00

Parameterized Algorithms for Hitting Set: the Weighted Case

RSS-Feed




TR06-072
Authors: Henning Fernau
Publication: 6th June 2006 16:07
Downloads: 2061
Keywords: 


Abstract:

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.



ISSN 1433-8092 | Imprint