I am not sure but an arbit way to do this would be to find
(totalsum/k) and do a bin packing for each of these , of course we
would be left with a few elements, we can put them in the bins with
max.slack space...It would be approximately correct I guess though not
sure.
Hope it helps
karthik
On 11/12/06, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
>
> Can someone please give me a algorithm/pseudo code for the following
> problem?
>
> Given an arrangement S of non-negative numbers {s1,s2,s3....sn} and an
> integer k.
> Partition S into k ranges, so as to minimize the maximum sum over all
> the ranges.
>
> e.g Optimally S={1,2,3,4,5,6,7,8,9} partitioned into k=3 ranges will be
> {1,2,3,4,5}, {6,7}, {8,9}
>
>
> >
>
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at
http://groups-beta.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
