Round-Robin is Optimal: Lower Bounds for Group Action Based Protocols.

Daniele Cozzo Emanuele Giunta

Published in: TCC (4) (2023)

Keyphrases

round robin
lower bound
optimal solution
upper bound
load balancing
worst case
optimal cost
scheduling policies
genetic algorithm
dynamic programming
np hard
branch and bound algorithm
association rules
expected cost
digital libraries
bin packing
objective function
load balance
data mining
graph colouring