A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set

Authors:
Henning Fernau
Affiliations:
Univ. Trier, FB 4—Abt. Informatik, 54286, Trier, Germany
Venue:
Algorithmica - Including a Special Section on Genetic and Evolutionary Computation; Guest Editors: Benjamin Doerr, Frank Neumann and Ingo Wegener
Year:
2010

Citing 0
Cited 7

Searching Trees: An Essay

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Parameterized algorithms for d-Hitting Set: The weighted case

Theoretical Computer Science
Kernelization for cycle transversal problems

Discrete Applied Mathematics
Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized approximation algorithms for hitting set

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Backdoors to satisfaction

The Multivariate Algorithmic Revolution and Beyond
Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we show how to systematically improve on parameterized algorithms and their analysis, focusing on search-tree based algorithms for 3-Hitting Set. We concentrate on algorithms which are easy to implement, in contrast with the highly sophisticated algorithms which have been designed previously to improve on the exponential base in the algorithms. However, this necessitates a more complex algorithm analysis based on a so-called auxiliary parameter, a technique which we believe can be used in other circumstances, as well.