3 citations · 3 across the 1 of their papers we have counts for
1 paper
Ömer Demirel, Ivo F. Sbalzarini
We propose a sorting-based greedy algorithm called SortedGreedy[m] for approximately solving the offline version of the d-choice weighted balls-into-bins problem where the number o…