Discrete load balancing on complete bipartite graphs

DOI10.1016/j.ipl.2021.106224OpenAlexW3213780618MaRDI QIDQ2059905

Chen-Hao Wang, Xiao-Min Huang

Publication date: 14 December 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106224

zbMATH Keywords

bipartite graphload balancingdistributed computing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Dynamic load balancing by random matchings
• Randomized diffusion for indivisible loads
• Some remarks on the stable matching problem
• First- and second-order diffusive methods for rapid, coarse, distributed load balancing
• Longest distance of a non-uniform dispersion process on the infinite line
• Near-perfect load balancing by randomized rounding

This page was built for publication: Discrete load balancing on complete bipartite graphs