Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Conditional Covering : Worst Case Analysis of Greedy Heuristics

  • Moon, I.Douglas (School of Management, the University of Michigan-Flint)
  • Published : 1990.12.01
Download PDF
⟨ Previous Next ⟩

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.

Keywords