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 $b$-matching, in which the input is a bipartite graph with capa…