Quadratic algorithm Choose a pair of entries (seeds) that is the most wasteful   Choose entries and such that w = volume( ) + (volume() + volume()) where is the covering hyper-rectangle of and is the largest and will be in different nodes If one group has entries, put the rest into the other group to avoid under flow Otherwise, choose next entry to assign   For each remaining entry, calculate and as the increase in volume of node 1 and node 2 respectively   Pick with largest For , pick the group with the minimum volume increase   If tie, choose group with smaller volume, then lesser number of entries