HIGHLIGHTS
- who: Bins and collaborators from the Max Planck Institute for Informatics, Saarbrücken, Germany University of Cambridge, UK have published the article: Balls into bins via local search: cover time and maximum load, in the Journal: (JOURNAL)
- what: The authors propose to study the following natural quantity related to any process based on allocating balls into bins. The authors show that for the local search allocation the cover time can be much smaller than n log n: the next theorem establishes that the cover time for vertex-transitive bounded√ degree graphs is Θ(R2 n) with . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.