0
$\begingroup$

I'm looking for efficient algorithm distributing atomic resources with arbitrar weight among a number of buckets with random capacity. Buckets can be added or removed, and resources from removed buckets should be redistributed among remaining ones. Are there any known algorithms solving this problem? Consider both situations when you can move already distributed resources and not.

$\endgroup$
  • 1
    $\begingroup$ I don't understand the problem. Is any arbitrary division OK? Are you trying to minimize/maximize some objective function? Do you care about the running time of the algorithm? Have you looked at algorithms for bin packing? en.wikipedia.org/wiki/Bin_packing_problem $\endgroup$ – D.W. Dec 17 '17 at 21:38
  • $\begingroup$ Thanks, looks like bin packing is exactly what i'm looking for! $\endgroup$ – xalz Dec 17 '17 at 21:53

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.