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

Authors:
S. Rajagopalan;V. V. Vazirani
Affiliations:
California Univ., Berkeley, CA, USA;-
Venue:
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Year:
1993

Citing 0
Cited 4

A Derandomization Using Min-Wise Independent Permutations

RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Approximation algorithms for covering/packing integer programs

Journal of Computer and System Sciences
On column-restricted and priority covering integer programs

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
On the approximability of positive influence dominating set in social networks

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.