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: | , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Society for Industrial and Applied Mathematics,
2021-04-08T16:45:50Z.
|
| Subjects: | |
| Online Access: | Get fulltext |