The round complexity of computing an O(log n / log log n)-approximation to the Santa Claus problem in CONGEST is hat Theta(sqrt n + D), with a stronger lower bound holding for any approximation.
Combinatorial AlgorithmforRestrictedMax-MinFairAllocation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distributed Santa Claus via Global Rounding
The round complexity of computing an O(log n / log log n)-approximation to the Santa Claus problem in CONGEST is hat Theta(sqrt n + D), with a stronger lower bound holding for any approximation.