Parameterized Approximation Algorithms for Hitting Set

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.

[1]  Marek Cygan,et al.  Exponential-time approximation of weighted set cover , 2009, Inf. Process. Lett..

[2]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[3]  Fenghui Zhang,et al.  3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size , 2011, Discret. Math. Algorithms Appl..

[4]  Henning Fernau,et al.  Combining Two Worlds: Parameterised Approximation for Vertex Cover , 2010, ISAAC.

[5]  Alberto Marchetti-Spaccamela,et al.  Theory and Practice of Algorithms in (Computer) Systems , 2011, Lecture Notes in Computer Science.

[6]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[7]  Henning Fernau.  A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set , 2008, Algorithmica.

[8]  Magnus Wahlström,et al.  Algorithms, measures and upper bounds for satisfiability and related problems , 2007 .

[9]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[10]  Fedor V. Fomin,et al.  Iterative compression and exact algorithms , 2010, Theor. Comput. Sci..

[11]  Jerzy Tyszkiewicz,et al.  Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings , 2008, MFCS.

[12]  Michael A. Langston,et al.  Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings , 2006, IWPEC.

[13]  Reuven Bar-Yehuda,et al.  One for the Price of Two: a Unified Approach for Approximating Covering Problems , 1998, Algorithmica.

[14]  Henning Fernau.  Parameterized algorithmics for d-Hitting Set , 2010, Int. J. Comput. Math..

[15]  Vangelis Th. Paschos,et al.  Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms , 2009, WADS.

[16]  Yijia Chen,et al.  On Parameterized Approximability , 2006, IWPEC.