The union of minimal hitting sets: parameterized combinatorial bounds and counting
From MaRDI portal
Publication:1044023
DOI10.1016/j.jda.2009.01.003zbMath1176.90602OpenAlexW2804485454MaRDI QIDQ1044023
Peter Damaschke, Leonid Molokov
Publication date: 10 December 2009
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2009.01.003
Related Items
Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing, Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing, Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover, On the parameterized complexity of reconfiguration problems, Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover, Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set
- Strong computational lower bounds via parameterized complexity
- An efficient fixed-parameter algorithm for 3-hitting set
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
- Counting models for 2SAT and 3SAT formulae
- On the number of vertices belonging to all maximum stable sets of a graph
- What makes propositional abduction tractable
- Crown reductions for the minimum weighted vertex cover problem
- Parameterized Algorithms for Hitting Set: The Weighted Case
- On the Effective Enumerability of NP Problems
- Kernelization Algorithms for d-Hitting Set Problems
- The Parameterized Complexity of Counting Problems
