The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting

DOI10.1007/978-3-540-70918-3_29MaRDI QIDQ3590944zbMATH OpenOpenAlexFDO

Authors Peter Damaschke

Publication date 3 September 2007

Published in STACS 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70918-3_29

zbMATH Keywords

algorithmscountingparameterizationhypergraph transversalscombinatorial inference

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Hypergraphs (05C65)

Recommendations

• The union of minimal hitting sets: parameterized combinatorial bounds and counting
• 3-hitting set on bounded degree hypergraphs: upper and lower bounds on the kernel size
• 3-\textsc{hitting set} on bounded degree hypergraphs: upper and lower bounds on the kernel size
• Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits
• Union-free hypergraphs and probability theory

Cited in

(2)

• The union of minimal hitting sets: parameterized combinatorial bounds and counting
• A top-down approach to search-trees: Improved algorithmics for 3-hitting set

This page was built for publication: The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590944)