ResearchTrend.AI
Improved Local Computation Algorithm for Set Cover via Sparsification
v1v2 (latest)

Improved Local Computation Algorithm for Set Cover via Sparsification

ACM-SIAM Symposium on Discrete Algorithms (SODA), 2019
Christoph Grunau
Slobodan Mitrovic
R. Rubinfeld
A. Vakilian
    LRM
ArXiv (abs)PDFHTML

Papers citing "Improved Local Computation Algorithm for Set Cover via Sparsification"

6 / 6 papers shown
Title
Beep-And-Sleep: Message and Energy Efficient Set Cover
Beep-And-Sleep: Message and Energy Efficient Set CoverAlgorithmic Aspects of Wireless Sensor Networks (AAWSN), 2021
Thorsten Götte
Christina Kolb
Christian Scheideler
Julian Werthmann
122
2
0
30 Jul 2021
The randomized local computation complexity of the Lovász local lemma
The randomized local computation complexity of the Lovász local lemmaACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2021
S. Brandt
Christoph Grunau
Václav Rozhon
124
10
0
30 Mar 2021
Active Local Learning
Active Local LearningAnnual Conference Computational Learning Theory (COLT), 2020
A. Backurs
Avrim Blum
Neha Gupta
189
3
0
31 Aug 2020
Black-box Methods for Restoring Monotonicity
Black-box Methods for Restoring MonotonicityInternational Conference on Machine Learning (ICML), 2020
Evangelia Gergatsouli
Brendan Lucier
Christos Tzamos
91
3
0
21 Mar 2020
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space
Krzysztof Onak
104
32
0
23 Jul 2018
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local ComputationACM-SIAM Symposium on Discrete Algorithms (SODA), 2018
M. Ghaffari
Jara Uitto
113
107
0
17 Jul 2018