Pages that link to "Item:Q4579900"
From MaRDI portal
The following pages link to Combinatorial approximation of maximum <i>k</i>-vertex cover in bipartite graphs within ratio 0.7 (Q4579900):
Displaying 5 items.
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108) (← links)
- An improved approximation for maximum \(k\)-dependent set on bipartite graphs (Q2057593) (← links)
- Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines (Q2289001) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- Approximation algorithms for partial vertex covers in trees (Q6554733) (← links)