@inproceedings{fbbcb18e1d6c493fadea722904309b5e,
title = "Parameterized Approximation Algorithms for Hitting Set",
abstract = "We are going to analyze simple search tree algorithms for approximating d-Hitting Set, focussing on the case of factor-2 approximations for d = 3. We also derive several results for hypergraph instances of bounded degree, including a new polynomial-time approximation.",
author = "Ljiljana Brankovic and Hening Fernau",
year = "2012",
month = dec,
day = "31",
doi = "10.1007/978-3-642-29116-6\_6",
language = "English",
isbn = "9783642291166",
series = "Lecture Notes in Computer Science",
publisher = "Springer Berlin, Heidelberg",
number = "7164",
pages = "63--76",
editor = "Roberto Solis-Oba and Giuseppe Persiano",
booktitle = "Approximation and Online Algorithms",
note = "WAOA 2011: 9th International Workshop on Approximation and Online Algorithms ; Conference date: 08-09-2011 Through 09-09-2011",
}