Parameterized Algorithms for Hitting Set: The Weighted Case
From MaRDI portal
Publication:3434568
DOI10.1007/11758471_32zbMath1183.68426OpenAlexW1702009171MaRDI QIDQ3434568
Publication date: 2 May 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11758471_32
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items (13)
Improved FPT algorithm for feedback vertex set problem in bipartite tournament ⋮ A top-down approach to search-trees: Improved algorithmics for 3-hitting set ⋮ Faster parameterized algorithms for two vertex deletion problems ⋮ Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover ⋮ Parameterized algorithms for \(d\)-hitting set: the weighted case ⋮ Iterative compression and exact algorithms ⋮ Iterative Compression and Exact Algorithms ⋮ Fixed-parameter algorithms for cluster vertex deletion ⋮ Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs ⋮ Fixed-Parameter Algorithms for Cluster Vertex Deletion ⋮ Multiple hypernode hitting sets and smallest two-cores with targets ⋮ The union of minimal hitting sets: parameterized combinatorial bounds and counting ⋮ Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
This page was built for publication: Parameterized Algorithms for Hitting Set: The Weighted Case
