Pages that link to "Item:Q5449551"
From MaRDI portal
The following pages link to A Unified Approach to Approximating Partial Covering Problems (Q5449551):
Displaying 15 items.
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- Prototype selection for interpretable classification (Q765979) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- Partial multicuts in trees (Q861281) (← links)
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
- Approximation algorithms for partially covering with edges (Q930925) (← links)
- One for the price of two: a unified approach for approximating covering problems (Q1977131) (← links)
- A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- From valid inequalities to heuristics: A unified view of primal-dual approximation algorithms in covering problems (Q2770094) (← links)
- (Q3585507) (← links)
- On Lagrangian Relaxation and Subset Selection Problems (Q3602837) (← links)
- (Q4535021) (← links)
- (Q5075823) (← links)
- On uniform covering, adaptive random search and raspberries (Q5927659) (← links)