Pages that link to "Item:Q1662108"
From MaRDI portal
The following pages link to Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108):
Displaying 8 items.
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs (Q820559) (← links)
- An improved approximation for maximum \(k\)-dependent set on bipartite graphs (Q2057593) (← links)
- On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs (Q3190147) (← links)
- Combinatorial approximation of maximum <i>k</i>-vertex cover in bipartite graphs within ratio 0.7 (Q4579900) (← links)
- An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs (Q5425488) (← links)
- Matroid-constrained vertex cover (Q6162073) (← links)
- On maximum Zagreb indices of bipartite graphs with a given connectivity (Q6650429) (← links)
