A simple approach for adapting continuous load balancing processes to discrete settings
DOI10.1145/2332432.2332486zbMath1301.68050OpenAlexW2064732923MaRDI QIDQ5891989
Thomas Sauerwald, Hoda Akbari, Petra Berenbrink
Publication date: 5 December 2014
Published in: Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://www.repository.cam.ac.uk/handle/1810/292829
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Flows in graphs (05C21) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items