Kernelization algorithms for d-hitting set problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4619 LNCS, Issue , 2007, Pages 434-445

  Abu Khzam, Faisal N ^a  

^a LEBANESE AMERICAN UNIVERSITY   (Lebanon)

Author keywords

[No Author keywords available]

Indexed keywords

PROBLEM SOLVING; QUADRATIC PROGRAMMING; SET THEORY;

KERNELIZATION ALGORITHMS; QUADRATIC KERNEL;

ALGORITHMS;

EID: 38149030989     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73951-7_38     Document Type: Conference Paper

References (16)

1. Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, CT.: Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. In: Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 62-69 (2004)
2. Abu-Khzam, F.N., Fellows, M.R., Langston, M.A., Suters, W.H.: Crown Structures for Vertex Cover Kernelization. Theory of Computing Systems (TOCS) (accepted for publication) (2006)
3. Abu-Khzam, F.N., Fernau, H.: Kernels: Annotated, Proper and Induced. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 264-275. Springer, Heidelberg (2006)
4. Buss, J.F., Goldsmith, J.: Nondeterminism within P. SIAM Journal on Computing 22, 560-572 (1993)
5. Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. Journal of Algorithms 41, 280-301 (2001)
6. 2) Steps. In: International Workshop on Graph Theoretic Concepts in Computer Science (WG), pp. 257-269 (2004)
7. Fernau, H.: A top-down approach to search-trees: Improved algorithmics for 3-Hitting Set. Electronic Colloquium on Computational Complexity (ECCC), p. 073 (2004)
8. Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman, New York (1979)
9. Jones, J.A., Harrold, M.J.: Test-Suite Reduction and Prioritization for Modified Condition/Decision Coverage. IEEE Trans. Software Eng. 29(3), 195-209 (2003)
10. Kuhn, F., von Rickenbach, P., Wattenhofer, R., Welzl, E., Zollinger, A.: Interference in Cellular Networks: The Minimum Membership Set Cover Problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, Springer, Heidelberg (2005)
11. Nemhauser, G.L., Trotter, L.E.: Vertex Packings: Structural Properties and Algorithms. Mathematical Programming 8, 232-248 (1975)
12. Niedermeier, R., Rossmanith, P.: An efficient fixed-parameter algorithm for 3-Hitting Set. Journal of Discrete Algorithms 1, 89-102 (2003)
13. Nishimura, N., Ragde, P., Thilikos, D.M.: Smaller kernels for hitting set problems of constant arity. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 121-126. Springer, Heidelberg (2004)
14. Ruchkys, D., Song, S.: A Parallel Approximation Hitting Set Algorithm for Gene Expression Analysis. In: SBAC-PAD '02: Proceedings of the 14th Symposium on Computer Architecture and High Performance Computing, Washington, DC, USA, p. 75. IEEE Computer Society, Los Alamitos (2002)
15. Thilikos, D.M.: Private communication (2005)
16. Weihe, K.: Covering trains by stations or the power of data reduction. In: Battiti, R., Bertossi, A.A. (eds.) International Conference on Algorithms and Experiments, pp. 1-8 (1998)