The union of minimal hitting sets: parameterized combinatorial bounds and counting
type: Item
instance of: scholarly article
title: The union of minimal hitting sets: parameterized combinatorial bounds and counting
zbMATH Open document ID: 1176.90602
author: Peter Damaschke
author: Leonid Molokov
published in: Journal of Discrete Algorithms
publication date: 2009-12-10T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5645003
zbMATH Keywords: algorithms
zbMATH Keywords: parameterization
zbMATH Keywords: combinatorial inference
zbMATH Keywords: counting
zbMATH Keywords: hypergraph transversals
MaRDI profile type: Publication
full work available at URL: j.jda.2009.01.003
OpenAlex ID: W2804485454
cites work: Kernelization Algorithms for d-Hitting Set Problems
cites work: On the number of vertices belonging to all maximum stable sets of a graph
cites work: Strong computational lower bounds via parameterized complexity
cites work: On the Effective Enumerability of NP Problems
cites work: Crown reductions for the minimum weighted vertex cover problem
cites work: Counting models for 2SAT and 3SAT formulae
cites work: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
cites work: Q4393480
cites work: Q4808679
cites work: A top-down approach to search-trees: Improved algorithmics for 3-hitting set
cites work: Parameterized Algorithms for Hitting Set: The Weighted Case
cites work: The Parameterized Complexity of Counting Problems
cites work: Q4398828
cites work: Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
cites work: Q5710169
cites work: An efficient fixed-parameter algorithm for 3-hitting set
cites work: What makes propositional abduction tractable
DOI: 10.1016/J.JDA.2009.01.003
description: scientific article; zbMATH DE number 5645003