English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Near-Perfect Load Balancing by Randomized Rounding

MPS-Authors
/persons/resource/persons44447

Friedrich,  Tobias
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45356

Sauerwald,  Thomas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Friedrich, T., & Sauerwald, T. (2009). Near-Perfect Load Balancing by Randomized Rounding. In Proceedings of the 41st ACM Symposium on Theory of Computing (pp. 121-130). New York, NY: ACM.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1886-E
Abstract
There is no abstract available