The following pages link to On Capacitated Set Cover Problems (Q3088080):
Displaying 8 items.
- Fixed-parameter algorithms for unsplittable flow cover (Q2701069) (← links)
- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching (Q3057615) (← links)
- (Q3688169) (← links)
- (Q3831014) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q5129231) (← links)
- On capacitated covering with unit balls (Q5266149) (← links)
- (Q5743501) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q6139826) (← links)