Parameterized algorithms for d - Hitting Set: The weighted case

We are going to analyze search tree algorithms for Weighted d - 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 ca...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 411; no. 16; pp. 1698 - 1713
Main Author: Fernau, Henning
Format: Journal Article
Language:English
Published: Oxford Elsevier B.V 28.03.2010
Elsevier
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Hitting set problems
Miscellaneous
Parameterized algorithms
Search tree algorithms
Theoretical computing
Search tree algorithms
Parameterized algorithms
Hitting set problems
Search tree
Computer theory
Search algorithm
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We are going to analyze search tree algorithms for Weighted d - 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 d .
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2010.01.001