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

Celý popis

Podrobná bibliografie

Vydáno v:	Theoretical computer science Ročník 411; číslo 16; s. 1698 - 1713
Hlavní autor:	Fernau, Henning
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford Elsevier B.V 28.03.2010 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!