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

DOI10.1007/978-3-540-70918-3_29zbMath1186.05087OpenAlexW5091314MaRDI QIDQ3590944

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

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

Related Items

A top-down approach to search-trees: Improved algorithmics for 3-hitting set