Towards optimal and expressive kernelization for d-hitting set

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

Volumn 7434 LNCS, Issue , 2012, Pages 121-132

  Van Bevern, René ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICALLY OPTIMAL; CARDINALITIES; DEFECTIVE STRUCTURES; HYPEREDGES; HYPERGRAPH; KERNELIZATION; LINEAR-TIME ALGORITHMS; PARAMETERIZED COMPLEXITY; POLYNOMIAL-TIME; PROBLEM KERNEL; VERTEX SET;

CLUSTERING ALGORITHMS; DATA REDUCTION; OPTIMIZATION;

GRAPH THEORY;

EID: 84864966458     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32241-9_11     Document Type: Conference Paper

References (22)

1. Abtreu, R., Zoeteweij, P., van Gemund, A.J.C.: A dynamic modeling approach to software multiple-fault localization. In: Proc. 19th DX, pp. 7-14. Blue Mountains, NSW, Australia (2008)
2. Abu-Khzam, F.N.: A kernelization algorithm for d-hitting set. J. Comput. Syst. Sci. 76(7), 524-531 (2010)
3. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley (1983)
4. van Bevern, R., Hartung, S., Kammer, F., Niedermeier, R., Weller, M.: Linear- Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol. 7112, pp. 194-206. Springer, Heidelberg (2012)
5. van Bevern, R., Moser, H., Niedermeier, R.: Approximation and tidying - a problem kernel for s-plex cluster vertex deletion. Algorithmica 62(3), 930-950 (2012)
6. Bodlaender, H.L.: Kernelization: New Upper and Lower Bound Techniques. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 17-37. Springer, Heidelberg (2009)
7. Dell, H., van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In: Proc. 42nd STOC 2010, pp. 251-260. ACM (2010)
8. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)
9. Erdo{combining double acute accent}s, P., Rado, R.: Intersection theorems for systems of sets. J. London Math. Soc. 35, 85-90 (1960)
10. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)
11. Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News 38(1), 31-45 (2007)
12. Hagerup, T.: Linear-Time Kernelization for Planar Dominating Set. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol. 7112, pp. 181-193. Springer, Heidelberg (2012)
13. Hüffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theory Comput. Syst. 47(1), 196-217 (2010)
14. de Kleer, J., Williams, B.C.: Diagnosing multiple faults. Artif. Intell. 32(1), 97-130 (1987)
15. 1 and MAX NP. Algorithmica 63(1), 532-550 (2012), ISSN 0178-4617
16. Moser, H.: Finding Optimal Solutions for Covering and Matching Problems. PhD thesis. Institut für Informatik, Friedrich-Schiller-Universität Jena (2010)
17. Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford University Press, USA (2006)
18. Niedermeier, R., Rossmanith, P.: An efficient fixed-parameter algorithm for 3- hitting set. J. Discrete Algorithms 1(1), 89-102 (2003)
19. 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)
20. Protti, F., Dantas da Silva, M., Szwarcfiter, J.: Applying modular decomposition to parameterized cluster editing problems. Theory Comput. Syst. 44, 91-104 (2009)
21. Reiter, R.: A theory of diagnosis from first principles. Artif. Intell. 32(1), 57-95 (1987)
22. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. A. Springer (2003)