Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs

@inproceedings{Rajagopalan1993PrimaldualRA,
  title={Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs},
  author={Sridhar Rajagopalan and Vijay V. Vazirani},
  booktitle={FOCS},
  year={1993}
}
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approxima.tion 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 [BRS89] [LN93], though not for any of its generalizations. 'Supported by NSF PYI Award CCR 88-96202 and NSF grant IRI 91… CONTINUE READING
32 Citations
6 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 32 extracted citations

Similar Papers

Loading similar papers…