Pages that link to "Item:Q744047"

The following pages link to Approximation algorithms for the partition vertex cover problem (Q744047):

Displaying 7 items.

• Approximation algorithm for vertex cover with multiple covering constraints (Q2072095) (← links)
• Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
• Tight approximation for partial vertex cover with hard capacities (Q2420573) (← links)
• On fair covering and hitting problems (Q2672421) (← links)
• (Q5075746) (← links)
• (Q5091035) (← links)
• On colorful vertex and edge cover problems (Q6088300) (← links)