scientific article; zbMATH DE number 1182766

zbMath0908.90213MaRDI QIDQ4400849

Dorit S. Hochbaum

Publication date: 2 August 1998

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

zbMATH Keywords

budget constraintellipsoid method\(t\)-vertex cover problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (19)

Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs ⋮ Improved Upper Bounds for Partial Vertex Cover ⋮ A primal-dual approximation algorithm for partial vertex cover: Making educated guesses ⋮ Partial multicuts in trees ⋮ On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs ⋮ Local ratio method on partial set multi-cover ⋮ An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem ⋮ On the partial vertex cover problem in bipartite graphs -- a parameterized perspective ⋮ A unified approach to approximating partial covering problems ⋮ The Approximability of Partial Vertex Covers in Trees ⋮ Lift \& project systems performing on the partial-vertex-cover polytope ⋮ Unnamed Item ⋮ Approximation algorithms for minimum weight partial connected set cover problem ⋮ Approximation algorithms for partial vertex covers in trees ⋮ Approximation algorithms for the partition vertex cover problem ⋮ Approximation algorithm for vertex cover with multiple covering constraints ⋮ Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs ⋮ On Partial Covering For Geometric Set Systems ⋮ Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations

This page was built for publication: