Linear-work greedy parallel approximate set cover and variants

@inproceedings{Blelloch2011LinearworkGP,
  title={Linear-work greedy parallel approximate set cover and variants},
  author={Guy E. Blelloch and Richard Peng and Kanat Tangwongsan},
  booktitle={SPAA},
  year={2011}
}
We present parallel greedy approximation algorithms for set cover and related problems. These algorithms build on an algorithm for solving a graph problem we formulate and study called Maximal Nearly Independent Set (MaNIS)---a graph abstraction of a key component in existing work on parallel set cover. We derive a randomized algorithm for MaNIS that has <i>O</i>(<i>m</i>) work and <i>O</i>(log<sup>2</sup> <i>m</i>) depth on input with <i>m</i> edges. Using MaNIS, we obtain RNC algorithms that… CONTINUE READING
Highly Cited
This paper has 44 citations. REVIEW CITATIONS

2 Figures & Tables

Topics

Statistics

01020201620172018
Citations per Year

Citation Velocity: 9

Averaging 9 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.