1 citations · 2 across the 4 of their papers we have counts for
3 papers · 1 filter
Dynamic Construction of the Lovász Local Lemma
Bernhard Haeupler, Slobodan Mitrović, Srikkanth Ramachandran +2
This paper proves that a wide class of local search algorithms extend as is to the fully dynamic setting with an adaptive adversary, achieving an amortized number of…
Improved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates
Slobodan Mitrović, Srikkanth Ramachandran, Ronitt Rubinfeld +1
In this work, we focus on designing an efficient Local Computation Algorithm (LCA) for the set cover problem, which is a core optimization task. The state-of-the-art LCA for comput…
Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
Jakub Łącki, Slobodan Mitrović, Srikkanth Ramachandran +1
We study the allocation problem in the Massively Parallel Computation (MPC) model. This problem is a special case of -matching, in which the input is a bipartite graph with capa…