Pages that link to "Item:Q3190147"
From MaRDI portal
The following pages link to On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs (Q3190147):
Displayed 9 items.
- Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs (Q820559) (← links)
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108) (← links)
- Better streaming algorithms for the maximum coverage problem (Q2322721) (← links)
- The Approximability of Partial Vertex Covers in Trees (Q2971146) (← links)
- Maximum Weighted Independent Sets with a Budget (Q2971655) (← links)
- Combinatorial approximation of maximum <i>k</i>-vertex cover in bipartite graphs within ratio 0.7 (Q4579900) (← links)
- Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs (Q5041208) (← links)
- On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs (Q5084707) (← links)
- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective (Q6151150) (← links)