Brief announcement: Efficient load-balancing through distributed token dropping

DOI10.4230/LIPICS.DISC.2020.40MaRDI QIDQ6535039zbMATH OpenFDO

Authors Sebastian F. Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto

Publication date 2 November 2023

Full work available at URL https://doi.org/10.4230/LIPICS.DISC.2020.40

zbMATH Keywords

distributed algorithmsgraph problemssemi-matching

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Locally optimal load balancing
• On the distributed complexity of the semi-matching problem
• Brief announcement: Distributed approximations for the semi-matching problem
• A note on the token distribution problem
• Distributed 2-approximation algorithm for the semi-matching problem

Cites work

• An Automatic Speedup Theorem for Distributed Problems
• Distributed 2-approximation algorithm for the semi-matching problem
• scientific article; zbMATH DE number 1303560 (Why is no real title available?)
• Linear-in- lower bounds in the LOCAL model
• Locality in Distributed Graph Algorithms
• What Can be Computed Locally?

This page was built for publication: Brief announcement: Efficient load-balancing through distributed token dropping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535039)