# Improved Bounds for Distributed Load Balancing

Zachary Langley

DISC, 2020.

Cited by: 0|Bibtex|Views8|
EI

Abstract:

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 $c \in C$ to an adjacent server $s \in S$. The load of a server is then the weighted sum of all the clients assigned to it. The goal is to compute an assignm...More

Code:

Data:

Full Text