A fast approximation algorithm for the multicovering problem

Bar-Yehuda, 1981, A linear-time approximation algorithm for the weighted vertex cover problem, J. Algorithms, 2, 198, 10.1016/0196-6774(81)90020-1 Dobson, 1982, Worst-case analysis of greedy heuristics for integer programming with non-negative data, Math. Operations Research, 7, 515, 10.1287/moor.7.4.515 Garey, 1979 Hall, 1983 Hochbaum, 1980, Approximation algorithms for the weighted set covering and node cover problems Hochbaum, 1982, SIAM J. Comput., 11, 555, 10.1137/0211045 Hochbaum, 1980, Fast approximation algorithms for some integer programming problems R. Van Slyke, Covering problems in CCCI systems, Report to the Air Force Office of Scientific Research. Xiaoming, 1984, Primal-dual heuristics for multiple set covering, 41, 63