scientific article; zbMATH DE number 1305393
From MaRDI portal
Publication:4252274
zbMath0974.68250MaRDI QIDQ4252274
Publication date: 12 December 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics in computer science (68R05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (9)
Improved Upper Bounds for Partial Vertex Cover ⋮ An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem ⋮ Subexponential algorithms for partial cover problems ⋮ On approximation of the submodular set cover problem ⋮ Approximation algorithms for minimum weight partial connected set cover problem ⋮ Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems ⋮ Computing small partial coverings ⋮ An approximation algorithm for the partial covering 0-1 integer program ⋮ Approximation algorithms for the partition vertex cover problem
This page was built for publication:
