The following pages link to (Q3824115):
Displaying 9 items.
- A-priori upper bounds for the set covering problem (Q271942) (← links)
- Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis (Q1041744) (← links)
- Optimal attribute sets for identifications and diagnoses (Q1090290) (← links)
- Pick-and-choose heuristics for partial set covering (Q1122585) (← links)
- Computational experience with approximation algorithms for the set covering problem (Q1278941) (← links)
- Clustering heuristics for set covering (Q1309879) (← links)
- A probabilistic analysis of the maximal covering location problem (Q1801679) (← links)
- On interval and circular-arc covering problems (Q2327673) (← links)
- On Partial Covers, Reducts and Decision Rules (Q3600307) (← links)
