1
$\begingroup$

Consider n buckets that contain from 0 to x items. From time to time something is added (moved, removed) to (between, from) any bucket(s).

Once in a while runs something that will have to calculate what items have to be moved from their bucket to another with minimal amount of moves so number of items in each bucket will be almost equal.

Is there a name for this algorithm?

$\endgroup$
  • $\begingroup$ This is similar to load balancing. $\endgroup$ – Yuval Filmus Aug 23 '18 at 14:47

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.