Abstract
We study how many vertices in a rank-r hypergraph can belong to the union of all inclusion-minimal hitting sets of at most k vertices. This union is interesting in certain combinatorial inference problems with hitting sets as hypotheses, as it provides a problem kernel for likelihood computations (which are essentially counting problems) and contains the most likely elements of hypotheses. We give worst-case bounds on the size of the union, depending on parameters r,k and the size k * of a minimum hitting set. (Note that k ≥ k * is allowed.) Our result for r = 2 is tight. The exact worst-case size for any r ≥ 3 remains widely open. By several hypergraph decompositions we achieve nontrivial bounds with potential for further improvements.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bafna, V., Reinert, K.: Mass spectrometry and computational proteomics. In: Encyclopedia of Genetics, Genomics, Proteomics and Bioinformatics, Wiley, Chichester (2005)
Boros, E., Golumbic, M.C., Levit, V.E.: On the number of vertices belonging to all maximum stable sets of a graph. Discrete Appl. Math. 124, 17–25 (2002)
Chen, J., et al.: Strong computational lower bounds via paramterized complexity. J. Comp. and System Sci. 72, 1346–1367 (2006)
Chen, J., et al.: On the effective enumerability of NP problems. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 215–226. Springer, Heidelberg (2006)
Chen, J., Kanj, I.A., Xia, G.: Improved parameterized upper bounds for vertex cover. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 238–249. Springer, Heidelberg (2006)
Chlebik, M., Chlebikova, J.: Crown reductions for the minimum weighted vertex cover problem. ECCC Report 101, to appear in Discrete Appl. Math. (2004)
Cicalese, F.: Center for Biotechnology, Univ. Bielefeld (personal communication)
Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction, Theoretical Computer Science 351. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 1–12. Springer, Heidelberg (2004)
Fernau, H.: On parameterized enumeration. In: H. Ibarra, O., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 564–573. Springer, Heidelberg (2002)
Fernau, H.: A top-down approach to search-trees: Improved algorithmics for 3-hitting set. ECCC Report 073 (2004)
Fernau, H.: Parameterized algorithms for hitting set: The weighted case. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 332–343. Springer, Heidelberg (2006)
Mitchell, T.: Machine Learning. McGraw-Hill, New York (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Damaschke, P. (2007). The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting. In: Thomas, W., Weil, P. (eds) STACS 2007. STACS 2007. Lecture Notes in Computer Science, vol 4393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70918-3_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-70918-3_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70917-6
Online ISBN: 978-3-540-70918-3
eBook Packages: Computer ScienceComputer Science (R0)