The following pages link to (Q4252274):
Displaying 4 items.
- An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem (Q403490) (← links)
- Approximation algorithms for the partition vertex cover problem (Q744047) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- Approximation algorithms for minimum weight partial connected set cover problem (Q5963645) (← links)