Computing small partial coverings
From MaRDI portal
Publication:1007552
DOI10.1016/S0020-0190(02)00434-9zbMath1173.68854OpenAlexW2073689249MaRDI QIDQ1007552
Publication date: 23 March 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00434-9
Related Items (20)
Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs ⋮ Improved Upper Bounds for Partial Vertex Cover ⋮ On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs ⋮ Combinatorial search in two and more rounds ⋮ Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems ⋮ Capacitated Domination and Covering: A Parameterized Perspective ⋮ FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective ⋮ Parameterized exact and approximation algorithms for maximumk-set cover and related satisfiability problems ⋮ A parameterized approximation scheme for generalized partial vertex cover ⋮ Representative families: a unified tradeoff-based approach ⋮ On the partial vertex cover problem in bipartite graphs -- a parameterized perspective ⋮ Subexponential algorithms for partial cover problems ⋮ Implicit branching and parameterized partial cover problems ⋮ Parameterized Dynamic Variants of Red-Blue Dominating Set ⋮ Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} ⋮ Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles ⋮ Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs ⋮ On the parameterized complexity of separating certain sources from the target ⋮ Moderately exponential time and fixed parameter approximation algorithms ⋮ Parameterized complexity of the anchored \(k\)-core problem for directed graphs
Cites Work
This page was built for publication: Computing small partial coverings
