Abstract
In [2], Chvatal provided the tight worst case bound of the set covering greedy heuristic. We considered a general class of greedy type set covering heuristics. Their worst case bounds are dominated by that of the greedy heuristic.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Balas and A. Ho, “Set covering algorithm using cutting planes, heuristics and subgradient optimization: A computational study”,Mathematical Programming Study 12 (1980) 37–60.
V. Chvatal, “A greedy heuristic for the set covering problem”,Mathematics of Operations Research 4 (1979) 233–235.
R. Garfinkel and G. Nemhauser,Integer programming (Wiley, New York, 1972).
D. Johnson, “Approximation algorithms for combinatorial problems”,Journal of Computer and System Science 9 (1974) 256–278.
R. Karp, “Reducibility among combinatorial problems”, in: R. Miller and J. Thatcher, eds.,Complexity of computer computations (Plenum Press, New York, 1972) pp. 85–103.
L. Lovasz, “On the ratio of optimal integral and fractional covers”,Discrete Mathematics 13 (1975) 383–390.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ho, A.C. Worst case analysis of a class of set covering heuristics. Mathematical Programming 23, 170–180 (1982). https://doi.org/10.1007/BF01583786
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01583786