The following pages link to Capacitated vertex covering (Q4458880):
Displaying 20 items.
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
- Capacitated domination problem (Q534769) (← links)
- Optimizing server placement in distributed systems in the presence of competition (Q635301) (← links)
- Online unit clustering: Variations on a theme (Q954982) (← links)
- A mixed integer linear program and tabu search approach for the complementary edge covering problem (Q964367) (← links)
- \(O(f)\) bi-criteria approximation for capacitated covering with hard capacities (Q1741845) (← links)
- Approximating dynamic weighted vertex cover with soft capacities (Q2072101) (← links)
- Iterative partial rounding for vertex cover with hard capacities (Q2223692) (← links)
- Facility location problems: a parameterized view (Q2275913) (← links)
- Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
- Capacitated Arc Stabbing (Q2376793) (← links)
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses (Q2391176) (← links)
- Tight approximation for partial vertex cover with hard capacities (Q2420573) (← links)
- A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
- Capacitated Domination and Covering: A Parameterized Perspective (Q3503580) (← links)
- (Q5009521) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- Tight approximation for partial vertex cover with hard capacities (Q5136285) (← links)
- Capacitated Domination Problem (Q5387762) (← links)
- Capacitated discrete unit disk cover (Q5918931) (← links)