Balanced allocation on dynamic hypergraphs

DOI10.4230/lipics.approx/random.2020.11OpenAlexW3082055600MaRDI QIDQ6084354

Ali Pourmiri, Bernard Mans, Catherine Greenhill

Publication date: 31 October 2023

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

zbMATH Keywords

balanced allocationballs-into-binspower of two choiceswitness tree technique

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Balls into bins with related random choices
• Regular graphs of large girth and arbitrary degree
• Balanced Allocation on Graphs: A Random Walk Approach
• Balls and Bins: Smaller Hash Families and Faster Evaluation
• Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified
• 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
• Derandomized Balanced Allocation
• Hashing, Load Balancing and Multiple Choice
• Balls into Bins via Local Search

This page was built for publication: Balanced allocation on dynamic hypergraphs