Pages that link to "Item:Q820559"
From MaRDI portal
The following pages link to Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs (Q820559):
Displaying 4 items.
- On approximation of max-vertex-cover (Q1848386) (← links)
- Approximation algorithm for sweep coverage on graph (Q2346569) (← links)
- On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs (Q3190147) (← links)
- Approximation Algorithms for Edge-Covering Problem (Q3628568) (← links)