The union of minimal hitting sets: Parameterized combinatorial bounds and counting

Journal of Discrete Algorithms

Volumn 7, Issue 4, 2009, Pages 391-401

  Damaschke, Peter ^a   Molokov, Leonid ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Algorithms; Combinatorial inference; Counting; Hypergraph transversals; Parameterization

Indexed keywords

ASYMPTOTICALLY OPTIMAL; COMBINATORIAL INFERENCE; CONSTANT FACTORS; COUNTING; HITTING SETS; HYPER GRAPH; HYPEREDGES; HYPERGRAPH TRANSVERSALS; INFERENCE PROBLEM; MINIMAL HITTING SET; OPEN PROBLEMS; PARAMETERIZED; RUNTIMES;

ASYMPTOTIC ANALYSIS; GRAPH THEORY; INFERENCE ENGINES;

SET THEORY;

EID: 70349782079     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2009.01.003     Document Type: Article

References (22)

1. F.N. Abu-Khzam, Kernelization algorithms for d-hitting set problems, in: 10th Int. Workshop on Algorithms and Data Structures WADS 2007, in: LNCS, vol. 4619, pp. 434-445
2. P. Alves, R.J. Arnold, M.V. Novotny, P. Radivojac, J.P. Reilly, H. Tang, Advancement in protein inference from shotgun proteomics using peptide detectability, in: 12th Pacific Symposium on Biocomputing 2007, pp. 409-422
3. Boros E., Golumbic M.C., and Levit V.E. On the number of vertices belonging to all maximum stable sets of a graph. Discrete Applied Mathematics 124 (2002) 17-25
4. Chen J., Huang X., Kanj I.A., and Xia G. Strong computational lower bounds via parameterized complexity. Journal of Computer and System Sciences 72 (2006) 1346-1367
5. J. Chen, I.A. Kanj, J. Meng, G. Xia, F. Zhang, On the effective enumerability of NP problems, in: 2nd Int. Workshop on Parameterized and Exact Computation IWPEC 2006, in: LNCS, vol. 4169, pp. 215-226
6. J. Chen, I.A. Kanj, G. Xia. Simplicity is beauty: Improved upper bounds for vertex cover, Technical Report, 2008
7. Chlebik M., and Chlebikova J. Crown reductions for the minimum weighted vertex cover problem. Discrete Applied Mathematics 156 (2008) 292-312
8. Dahllöf V., Jonsson P., and Wahlström M. Counting models for 2SAT and 3SAT formulae. Theoretical Computer Science 332 (2005) 265-291
9. Damaschke P. Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theoretical Computer Science 351 (2006) 337-350 special issue of selected papers from IWPEC 2004
10. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer
11. H. Fernau, On parameterized enumeration, in: 8th Int. Computing and Combinatorics Conference COCOON 2002, in: LNCS, vol. 2387, pp. 564-573
12. H. Fernau, A top-down approach to search-trees: Improved algorithmics for 3-hitting set, ECCC Report 073, 2004
13. H. Fernau, Parameterized algorithms for hitting set: The weighted case, in: 6th Italian Conference on Algorithms and Complexity CIAC 2006, in: LNCS, vol. 3998, pp. 332-343
14. Flum J., and Grohe M. The parameterized complexity of counting problems. SIAM Journal on Computing 33 (2004) 892-922
15. Mitchell T. Machine Learning (1997), McGraw-Hill
16. Mölle D., Richter S., and Rossmanith P. Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. Theory of Computing Systems 43 (2008) 234-253
17. Nesvizhskii A.I., and Aebersold R. Interpretation of shotgun proteomic data: The protein inference problem. Molecular and Cellular Proteomics 4 (2005) 1419-1440
18. Niedermeier R. Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications (2006), Oxford University Press
19. Niedermeier R., and Rossmanith P. An efficient fixed-parameter algorithm for 3-hitting set. Journal of Discrete Algorithms 1 (2003) 89-102
20. G. Nordh, B. Zanuttini, Propositional abduction is almost always hard, in: 19th Int. Joint Conference on Artificial Intelligence IJCAI 2005, pp. 534-539
21. M. Thurley, Tractabili ty and intractability of parameterized counting problems, Master's thesis, Institute for Computer Science, Humboldt-Univ. Berlin, 2006, also in: Master-/Diploma Theses Series of ECCC
22. M. Wahlström, Algorithms, measures, and upper bounds for satisfiability and related problems, PhD Thesis 1079, Linköping Studies in Science and Technology, 2007