Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)
- Volume 15 Issue 2
- /
- Pages.97-104
- /
- 1990
- /
- 1225-1119(pISSN)
- /
- 2733-4759(eISSN)
Conditional Covering : Worst Case Analysis of Greedy Heuristics
Abstract
The problem is a variation of the weighted set-covering problem (SCP) which requires the minimum-cost cover to be self-covering. It is shown that direct extension of the well-known greedy heuristic for SCP can have an arbitrarily large error in the worst case. It remains an open question whther these exists a greedy heuristic with a finite error bound.