Sciweavers

Share
SIAMCOMP
1998

Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs

8 years 9 months ago
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
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 the generalizations considered in this paper. Key words. algorithms, set cover, primal-dual, parallel, approximation, voting lemmas PII. S0097539793260763
Sridhar Rajagopalan, Vijay V. Vazirani
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 1998
Where SIAMCOMP
Authors Sridhar Rajagopalan, Vijay V. Vazirani
Comments (0)
books