Parameterized algorithmics for d-Hitting Set

Based on the methodology we presented in earlier work on parameterized algorithms for 3-Hitting Set, we develop simple search tree-based algorithms for d-Hitting Set. We considerably improve on the bounds that were elsewhere derived for these problems.

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of computer mathematics Ročník 87; číslo 14; s. 3157 - 3174
Hlavní autor: Fernau, Henning
Médium: Journal Article
Jazyk:angličtina
Vydáno: Abingdon Taylor & Francis 01.11.2010
Taylor & Francis Ltd
Témata:
Algorithms
analysis of search tree algorithms
Hitting Set problems
Mathematical analysis
Mathematical models
Mathematical problems
Methodology
parameterized algorithms
Searching
ISSN:0020-7160, 1029-0265
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!
Popis
Shrnutí:Based on the methodology we presented in earlier work on parameterized algorithms for 3-Hitting Set, we develop simple search tree-based algorithms for d-Hitting Set. We considerably improve on the bounds that were elsewhere derived for these problems.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0020-7160
1029-0265
DOI:10.1080/00207160903176868