Pages that link to "Item:Q5449551"
From MaRDI portal
The following pages link to A Unified Approach to Approximating Partial Covering Problems (Q5449551):
Displaying 7 items.
- 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)
- Approximation algorithms for partially covering with edges (Q930925) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- On Lagrangian Relaxation and Subset Selection Problems (Q3602837) (← links)
- (Q5075823) (← links)
