The following pages link to (Q4843442):
Displaying 12 items.
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- Computational experience with approximation algorithms for the set covering problem (Q1278941) (← links)
- A modified greedy heuristic for the set covering problem with improved worst case bound (Q1334632) (← links)
- A new approximation algorithm for \(k\)-set cover problem (Q1639350) (← links)
- On the differential approximation of MIN SET COVER (Q1770405) (← links)
- Approximation of the quadratic set covering problem (Q2427697) (← links)
- Improved approximation algorithms for low-density instances of the minimum entropy set cover problem (Q2446594) (← links)
- (Q4411280) (← links)
- Approximation algorithms for integer covering problems via greedy column generation (Q4846487) (← links)
- A New Efficient Heuristic for the Minimum Set Covering Problem (Q4864354) (← links)
- Algorithms and Computation (Q5897901) (← links)
- Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)