Balanced allocation on hypergraphs

DOI10.1016/j.jcss.2023.05.004zbMath1529.90081arXiv2006.07588OpenAlexW3208267677MaRDI QIDQ6133644

Catherine Greenhill, Ali Pourmiri, Bernard Mans

Publication date: 21 August 2023

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.07588

zbMATH Keywords

hypergraphsballs into binsbalanced allocation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Hypergraphs (05C65) Randomized algorithms (68W20)

Related Items

The Power of Filling in Balanced Allocations

Cites Work

• Balls into bins with related random choices
• Regular graphs of large girth and arbitrary degree
• The power of thinning in balanced allocation
• Balanced Allocation on Graphs: A Random Walk Approach
• Balls and Bins: Smaller Hash Families and Faster Evaluation
• How asymmetry helps load balancing
• Graphical balanced allocations and the (1 + β)-choice process
• Balanced allocation on graphs
• Balanced Allocations
• The Power of Two Choices with Simple Tabulation
• Balls and bins: A study in negative dependence
• Derandomized Balanced Allocation
• Hashing, Load Balancing and Multiple Choice
• Balls into Bins via Local Search
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item