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.

Podrobná bibliografia

Vydané v:	International journal of computer mathematics Ročník 87; číslo 14; s. 3157 - 3174
Hlavný autor:	Fernau, Henning
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Abingdon Taylor & Francis 01.11.2010 Taylor & Francis Ltd
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!