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

Authors:
Sridhar Rajagopalan;Vijay V. Vazirani
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
1999

Citing 0
Cited 44

On the red-blue set cover problem

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Algorithmic derandomization via complexity theory

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Topology control and routing in ad hoc networks: a survey

ACM SIGACT News
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Greedy Facility Location Algorithm Analyzed Using Dual Fitting

APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
An efficient distributed algorithm for constructing small dominating sets

Distributed Computing - Special issue: Selected papers from PODC '01
Constant-time distributed dominating set approximation

Proceedings of the twenty-second annual symposium on Principles of distributed computing
A derandomization using min-wise independent permutations

Journal of Discrete Algorithms
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

Journal of the ACM (JACM)
Finding r-Dominating Sets and p-Centers of Trees in Parallel

IEEE Transactions on Parallel and Distributed Systems
An anonymous self-stabilizing algorithm for 1-maximal independent set in trees

Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
On finding minimal w-cutset

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Facility location: distributed approximation

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The price of being near-sighted

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons

Journal of Computer and System Sciences
A fast localized algorithm for scheduling sensors

Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Constant-time distributed dominating set approximation

Distributed Computing
On space constrained set selection problems

Data & Knowledge Engineering
Hierarchical routing in ad hoc networks using k-dominating sets

ACM SIGMOBILE Mobile Computing and Communications Review
Convex Combination Approximation for the Min-Cost WSN Point Coverage Problem

WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
On the Approximability of Combinatorial Exchange Problems

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
On the approximability of Dodgson and Young elections

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Efficient Sensor Placement for Surveillance Problems

DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Set multi-covering via inclusion-exclusion

Theoretical Computer Science
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Exact Algorithms for Set Multicover and Multiset Multicover Problems

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes

Mobile Networks and Applications
Protecting individual information against inference attacks in data publishing

DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Dynamic programming based algorithms for set multicover and multiset multicover problems

Theoretical Computer Science
Parallel approximation algorithms for facility-location problems

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Collaborative data compression using clustered source coding for wireless multimedia sensor networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
On positive influence dominating sets in social networks

Theoretical Computer Science
Linear-work greedy parallel approximate set cover and variants

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints

Theoretical Computer Science
Hierarchical routing in sensor networks using k-dominating sets

IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Bucket game with applications to set multicover and dynamic page migration

ESA'05 Proceedings of the 13th annual European conference on Algorithms
A better-than-greedy algorithm for k-set multicover

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Greedy approximation via duality for packing, combinatorial auctions and routing

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints

WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
An adaptive updating protocol for reducing moving object database workload

The VLDB Journal — The International Journal on Very Large Data Bases
A self-stabilizing algorithm to maximal 2-packing with improved complexity

Information Processing Letters
On the approximability of Dodgson and Young elections

Artificial Intelligence
Parallel and I/O efficient set covering algorithms

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures

Quantified Score

Hi-index	0.01

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 the generalizations considered in this paper.