Streaming and Communication Complexity of Load-Balancing via Matching Contractors

Sepehr Assadi, Aaron Bernstein, Zachary Langley +2

In the load-balancing problem, we have an $n$-vertex bipartite graph $G=(L,R,E)$ between a set of clients and servers. The goal is to find an assignment of all clients to the ser…