Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling

Laxman Dhulipala, Michael Dinitz, Jakub ÅÄ cki +1

The SetCover problem has been extensively studied in many different models of computation, including parallel and distributed settings. From an approximation point of view, there a…