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.

Bibliographische Detailangaben

Veröffentlicht in:	International journal of computer mathematics Jg. 87; H. 14; S. 3157 - 3174
1. Verfasser:	Fernau, Henning
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Abingdon Taylor & Francis 01.11.2010 Taylor & Francis Ltd
Schlagworte:	Algorithms analysis of search tree algorithms Hitting Set problems Mathematical analysis Mathematical models Mathematical problems Methodology parameterized algorithms Searching
ISSN:	0020-7160, 1029-0265
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!