Improved Bounds for Distributed Load Balancing

Sepehr Assadi, Aaron Bernstein, Zachary Langley

In the load balancing problem, the input is an $n$-vertex bipartite graph $G=(C\cup S,E)$ and a positive weight for each client $c\in C$. The algorithm must assign each client…