Pages that link to "Item:Q1662108"

The following pages link to Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108):

Displaying 2 items.

• Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs (Q820559) (← links)
• Matroid-constrained vertex cover (Q6162073) (← links)