scientific article

zbMath1327.05054arXiv1211.4853MaRDI QIDQ3455036

Adrian Vetta, Gwenaël Joret

Publication date: 3 December 2015

Full work available at URL: https://arxiv.org/abs/1211.4853

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

matroidpartial vertex covermaximum vertex cover

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs ⋮ Covering Vectors by Spaces: Regular Matroids ⋮ On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs ⋮ Computing densest \(k\)-subgraph with structural parameters ⋮ Parametric matroid interdiction ⋮ On the partial vertex cover problem in bipartite graphs -- a parameterized perspective ⋮ Unnamed Item ⋮ Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives ⋮ The maximum vertex coverage problem on bipartite graphs ⋮ Blocking optimal arborescences ⋮ Blocking unions of arborescences ⋮ Blocking optimal structures ⋮ The complexity of mixed-connectivity ⋮ Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs ⋮ Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs