A Unified Approach to Approximating Partial Covering Problems
From MaRDI portal
Publication:5449551
DOI10.1007/11841036_43zbMath1131.90443OpenAlexW2148525712MaRDI QIDQ5449551
Jochen Könemann, Ojas Parekh, Danny Segev
Publication date: 11 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11841036_43
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (7)
Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing ⋮ Partial multicuts in trees ⋮ The maximum vertex coverage problem on bipartite graphs ⋮ Approximation algorithms for partially covering with edges ⋮ Unnamed Item ⋮ On Lagrangian Relaxation and Subset Selection Problems ⋮ Prototype selection for interpretable classification
This page was built for publication: A Unified Approach to Approximating Partial Covering Problems
