A kernelization algorithm for d-Hitting Set

Journal of Computer and System Sciences

Volumn 76, Issue 7, 2010, Pages 524-531

  Abu Khzam, Faisal N ^a  

^a LEBANESE AMERICAN UNIVERSITY   (Lebanon)

Author keywords

Crown decomposition; Fixed parameter algorithms; Hitting Set; Hypergraphs; Kernelization; Vertex cover

Indexed keywords

GRAPH THEORY; POLYNOMIAL APPROXIMATION;

FIXED-PARAMETER ALGORITHMS; HITTING SETS; HYPER GRAPH; KERNELIZATION; VERTEX COVER;

PARAMETER ESTIMATION;

EID: 77955429131     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2009.09.002     Document Type: Article

References (21)

1. F.N. Abu-Khzam, R.L. Collins, M.R. Fellows, M.A. Langston, W.H. Suters, C.T. Symons, Kernelization algorithms for the vertex cover problem: Theory and experiments, in: Workshop on Algorithm Engineering and Experiments (ALENEX), 2004, pp. 62-69
2. F.N. Abu-Khzam, M.R. Fellows, M.A. Langston, and W.H. Suters Crown structures for vertex cover kernelization Theory Comput. Syst. 41 3 2007 411 430
3. F.N. Abu-Khzam, H. Fernau, Kernels: Annotated, proper and induced, in: International Workshop on Parameterized and Exact Computation (IWPEC), 2006, pp. 264-275
4. F.N. Abu-Khzam A quadratic kernel for 3-set packing Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation TAMC 2009 Lecture Notes in Comput. Sci. vol. 5532 2009 81 87
5. J.F. Buss, and J. Goldsmith Nondeterminism within P SIAM J. Comput. 22 1993 560 572
6. 2)steps, in: International Workshop on Graph Theoretic Concepts in Computer Science (WG), 2004, pp. 257-269
7. H. Dell, Private communication, 2009
8. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer
9. H. Fernau, A top-down approach to search-trees: Improved algorithmics for 3-Hitting Set, in: Electronic Colloquium on Computational Complexity (ECCC), 2004, p. 073
10. J. Flum, and M. Grohe Parameterized Complexity Theory 2006 Springer
11. M.R. Garey, and D.S. Johnson Computers and Intractability 1979 W.H. Freeman New York
12. Falk Hüffner, Algorithms and experiments for parameterized approaches to hard graph problems, PhD thesis, Institut für Informatik, Friedrich-Schiller-Universität Jena, 2007
13. James A. Jones, and Mary Jean Harrold Test-suite reduction and prioritization for modified condition/decision coverage IEEE Trans. Software Eng. 29 3 2003 195 209
14. Fabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl, Aaron Zollinger, Interference in cellular networks: The minimum membership set cover problem, in: 11th International Computing and Combinatorics Conference (COCOON), Kunming, Yunnan, China, August 2005
15. Hannes Mozer A problem kernelization for graph packing 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM) Lecture Notes in Comput. Sci. vol. 5404 2009 401 412
16. G.L. Nemhauser, and L.E. Trotter Vertex packings: Structural properties and algorithms Math. Program. 8 1975 232 248
17. R. Niedermeier, and P. Rossmanith An efficient fixed-parameter algorithm for 3-Hitting Set J. Discrete Algorithms 1 2003 89 102
18. N. Nishimura, P. Ragde, and D.M. Thilikos Smaller kernels for hitting set problems of constant arity International Workshop on Parameterized and Exact Computation (IWPEC) Lecture Notes in Comput. Sci. vol. 3162 2004 121 126
19. D. Ruchkys, and S. Song A parallel approximation hitting set algorithm for gene expression analysis SBAC-PAD '02: Proceedings of the 14th Symposium on Computer Architecture and High Performance Computing 2002 IEEE Computer Society Washington, DC, USA 75
20. D.M. Thilikos, Private communication, 2005
21. K. Weihe, Covering trains by stations or the power of data reduction, in: R. Battiti, A.A. Bertossi (Eds.), International Conference on Algorithms and Experiments, 1998, pp. 1-8