Improved local computation algorithm for set cover via sparsification
We design a Local Computation Algorithm (LCA) for the set cover problem. Given a set system where each set has size at most s and each element is contained in at most t sets, the algorithm reports whether a given set is in some fixed set cover whose expected size is O(log s) times the minimum fracti...
Main Authors: | Mitrović, Slobodan (Author), Rubinfeld, Ronitt (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor) |
Format: | Article |
Language: | English |
Published: |
Society for Industrial and Applied Mathematics,
2021-04-08T16:45:50Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
by: Ghaffari, Mohsen, et al.
Published: (2021) -
Local Computation Algorithms for Graphs of Non-constant Degrees
by: Levi, Reut, et al.
Published: (2021) -
Local Computation Algorithms for Graphs of Non-constant Degrees
by: Levi, Reut, et al.
Published: (2022) -
Vertex sparsification and universal rounding algorithms
by: Moitra, Ankur
Published: (2011) -
Space-Efficient Local Computation Algorithms
by: Alon, Noga, et al.
Published: (2012)