Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs
S. P. Rajagopalan, Vijay V. Vazirani · 2002
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover problem and its generalizations. Our algorithms use randomization, and our randomized voting lemmas may be of independent interest. Fast parallel approximation algorithms were known before for set cover, though not for any of its generalizations.>