Faster Set Cover in the MPC Model
Open Access
- 4 January 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 144-151
Abstract
No abstract availableFunding Information
- National Science Foundation (1955939)
- Research Council of Finland Grant 334238, Helsinki Institute for Information Technology (HIIT) (334238)
This publication has 24 references indexed in Scilit:
- Beep-And-Sleep: Message and Energy Efficient Set Cover2021
- Near-Constant-Time Distributed Algorithms on a Congested CliqueLecture Notes in Computer Science, 2014
- Sorting, Searching, and Simulation in the MapReduce Framework2011
- An efficient distributed algorithm for constructing small dominating setsDistributed Computing, 2002
- Distributed Computing: A Locality-Sensitive Approach2000
- Efficient NC algorithms for set cover with applications to learning and geometryJournal of Computer and System Sciences, 1994
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974