Publication Details
Title: Near-Perfect Load Balancing by Randomized Rounding
Author: T. Friedrich and T. Sauerwald
Group: Algorithms
Date: May 2009
PDF: http://www.icsi.berkeley.edu/pubs/algorithms/nearlyperfect09.pdf
Acknowledgements:
This work was partially funded by the Deutscher Akademischer Austausch Diesnst (DAAD) through postdoctoral fellowships.
Bibliographic Information:
Proceedings of the 41st ACM Symposium on Theory of Computing (STOC 2009), Bethesda, Maryland, pp. 121-130
Bibliographic Reference:
T. Friedrich and T. Sauerwald. Near-Perfect Load Balancing by Randomized Rounding. Proceedings of the 41st ACM Symposium on Theory of Computing (STOC 2009), Bethesda, Maryland, pp. 121-130, May 2009
Author: T. Friedrich and T. Sauerwald
Group: Algorithms
Date: May 2009
PDF: http://www.icsi.berkeley.edu/pubs/algorithms/nearlyperfect09.pdf
Acknowledgements:
This work was partially funded by the Deutscher Akademischer Austausch Diesnst (DAAD) through postdoctoral fellowships.
Bibliographic Information:
Proceedings of the 41st ACM Symposium on Theory of Computing (STOC 2009), Bethesda, Maryland, pp. 121-130
Bibliographic Reference:
T. Friedrich and T. Sauerwald. Near-Perfect Load Balancing by Randomized Rounding. Proceedings of the 41st ACM Symposium on Theory of Computing (STOC 2009), Bethesda, Maryland, pp. 121-130, May 2009