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.

Saved in:
Bibliographic Details
Published in:International journal of computer mathematics Vol. 87; no. 14; pp. 3157 - 3174
Main Author: Fernau, Henning
Format: Journal Article
Language:English
Published: Abingdon Taylor & Francis 01.11.2010
Taylor & Francis Ltd
Subjects:
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 Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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