Faster set cover in the MPC model
From MaRDI portal
Cites work
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- A Greedy Heuristic for the Set-Covering Problem
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- An efficient distributed algorithm for constructing small dominating sets
- Analytical approach to parallel repetition
- Approximation algorithms for combinatorial problems
- Beep-and-sleep: message and energy efficient set cover
- Congested clique algorithms for graph spanners
- Distributed Computing: A Locality-Sensitive Approach
- Distributed MIS via all-to-all communication
- Distributed spanner approximation
- scientific article; zbMATH DE number 6297759 (Why is no real title available?)
- Improved massively parallel computation algorithms for MIS, matching, and vertex cover
- Massively Parallel Computation of Matching and MIS in Sparse Graphs
- Near-constant-time distributed algorithms on a congested clique
- On distributing symmetric streaming computations
- On the ratio of optimal integral and fractional covers
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Round compression for parallel matching algorithms
- Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC
- Sorting, searching, and simulation in the MapReduce framework
- Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation
This page was built for publication: Faster set cover in the MPC model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7396343)
