1 paper
Petra Berenbrink, Robert Elsässer, Tom Friedetzky +4
We consider discrete, iterative load balancing via matchings on arbitrary graphs. Initially each node holds a certain number of tokens, defining the load of the node, and the objec…