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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 411; H. 16; S. 1698 - 1713
1. Verfasser:	Fernau, Henning
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Oxford Elsevier B.V 28.03.2010 Elsevier
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!