Worst-case bounds are given on the performance of the greedy heuristic for a continuous version of the set covering problem. This generalizes results of Chvatal, Johnson and Lovasz for the 0-1 covering problem. The results for the greedy heuristic and for other heuristics are obtained by treating the covering problem as a limiting case of a generalized location problem for which worst-case results are known. An alternative approach involving dual greedy heuristics leads also to worst-case bounds for continuous packing problems.
No takes yet. Share an insight, caveat, or question.
Fisher et al. (1982) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: