# Improved Bounds for Distributed Load Balancing

@inproceedings{Assadi2020ImprovedBF, title={Improved Bounds for Distributed Load Balancing}, author={S. Assadi and A. Bernstein and Zachary Langley}, booktitle={DISC}, year={2020} }

In the load balancing problem, the input is an n-vertex bipartite graph G = (C ∪ S,E)— where the two sides of the bipartite graph are referred to as the clients and the servers—and a positive weight for each client c ∈ C. The algorithm must assign each client c ∈ C to an adjacent server s ∈ S. The load of a server is then the weighted sum of all the clients assigned to it. The goal is to compute an assignment that minimizes some function of the server loads, typically either the maximum server… CONTINUE READING

#### Topics from this paper.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 25 REFERENCES

Distributed 2-Approximation Algorithm for the Semi-matching Problem

- Computer Science, Mathematics
- 2012

- 21

Semi-matchings for Bipartite Graphs and Load Balancing

- Computer Science
- 2003

- 51
- Highly Influential
- Open Access

Online Bipartite Matching with Amortized O(log 2 n) Replacements

- Computer Science, Mathematics
- 2019

- 16
- Open Access

Improved Distributed Approximate Matching

- Computer Science, Mathematics
- 2015

- 60
- Highly Influential
- Open Access