Near-Perfect Load Balancing by Randomized Rounding
| Title | Near-Perfect Load Balancing by Randomized Rounding |
| Publication Type | Conference Paper |
| Year of Publication | 2009 |
| Authors | Friedrich, T., & Sauerwald T. |
| Page(s) | 121-130 |
| Other Numbers | 2419 |
| Acknowledgment | This work was partially funded by the Deutscher Akademischer Austausch Diesnst (DAAD) through postdoctoral fellowships. |
| URL | http://www.icsi.berkeley.edu/pubs/algorithms/nearlyperfect09.pdf |
| Bibliographic Notes | Proceedings of the 41st ACM Symposium on Theory of Computing (STOC 2009), Bethesda, Maryland, pp. 121-130 |
| Abbreviated Authors | T. Friedrich and T. Sauerwald |
| ICSI Research Group | Algorithms |
| ICSI Publication Type | Article in conference proceedings |