Parameterized algorithmics for d-Hitting Set

Name: Parameterized algorithmics for d -H itting S et
Creator: Fernau, Henning
Keywords: analysis of search tree algorithms, parameterized algorithms, 4. Education, 0202 electrical engineering, electronic engineering, information engineering, d-HITTING SET, 0102 computer and information sciences, 02 engineering and technology, HITTING SET problems, 01 natural sciences

descriptionPublicationkeyboard_double_arrow_right Article 01 Nov 2010 English Publisher:Informa UK LimitedJournal:International Journal of Computer Mathematics, volume 87, pages 3,157-3,174 (issn: 0020-7160, eissn: 1029-0265,

Authors: Fernau, Henning;

doi: 10.1080/00207160903176868

handle: 1959.13/929742

Parameterized algorithmics for d-Hitting Set

- Summary
- Subjects
- Metrics

Abstract

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.

Related Organizations

University of Trier
Germany
University of Newcastle Australia
Australia

Keywords

analysis of search tree algorithms, parameterized algorithms, d-HITTING SET, HITTING SET problems

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	11
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average