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

Improved Local Computation Algorithm for Set Cover via Sparsification

Christoph Grunau
Slobodan Mitrovic
R. Rubinfeld
A. Vakilian
    LRM
ArXiv (abs)PDFHTML

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

5 / 5 papers shown
Title
The randomized local computation complexity of the Lovász local lemma
The randomized local computation complexity of the Lovász local lemma
S. Brandt
Christoph Grunau
Václav Rozhon
66
10
0
30 Mar 2021
Active Local Learning
Active Local Learning
A. Backurs
Avrim Blum
Neha Gupta
79
2
0
31 Aug 2020
Black-box Methods for Restoring Monotonicity
Black-box Methods for Restoring Monotonicity
Evangelia Gergatsouli
Brendan Lucier
Christos Tzamos
47
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
68
30
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 Computation
M. Ghaffari
Jara Uitto
64
103
0
17 Jul 2018

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.