![Combinatorial optimization / Matching / Graph coloring / Low-discrepancy sequence / Connectivity / Theorems and definitions in linear algebra / Errors-in-variables models / Mathematics / Theoretical computer science / Applied mathematics Combinatorial optimization / Matching / Graph coloring / Low-discrepancy sequence / Connectivity / Theorems and definitions in linear algebra / Errors-in-variables models / Mathematics / Theoretical computer science / Applied mathematics](https://www.pdfsearch.io/img/de011b7128b3ad1e71168abc99cf0ced.jpg) Date: 2012-08-19 16:40:34Combinatorial optimization Matching Graph coloring Low-discrepancy sequence Connectivity Theorems and definitions in linear algebra Errors-in-variables models Mathematics Theoretical computer science Applied mathematics | | Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies Thomas Sauerwald∗ and He Sun∗† Max Planck Institute for Informatics Saarbr¨ucken 66123, Germany † Institute of Modern Mathematics and PhAdd to Reading ListSource URL: people.mpi-inf.mpg.deDownload Document from Source Website File Size: 393,53 KBShare Document on Facebook
|