Sciweavers

STOC
2009
ACM
133views Algorithms» more  STOC 2009»
15 years 4 days ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald