The following pages link to (Q4449173):
Displaying 7 items.
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- Capacitated Arc Stabbing (Q2376793) (← links)
- A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
- An improved approximation algorithm for vertex cover with hard capacities (Q2581755) (← links)
- Randomized rounding in the presence of a cardinality constraint (Q2828177) (← links)
- Linear time algorithms for approximating the facility terminal cover problem (Q3593378) (← links)
- On hard instances of approximate vertex cover (Q4962765) (← links)