Not sure what you are suggesting. If you bring to the root which has
capacity to hold then it looks like you are disturbing the order of
the bins.
On Sat, May 14, 2011 at 1:34 PM, pacific :-) pacific4...@gmail.com wrote:
i think we can use heaps for this problem..bring to the root which has
@MK: When we insert a value, we first delete that bin from the tree, then we
change the old root value and then we reinsert that bin into the tree.
On Sat, May 14, 2011 at 5:26 PM, MK stardust...@gmail.com wrote:
Not sure what you are suggesting. If you bring to the root which has
capacity
i think we can use heaps for this problem..bring to the root which has
capacity to hold and pick the root each time. If the root cannot accomodate
then no other node will be able to accomodate.
On Sat, May 14, 2011 at 1:26 AM, MK stardust...@gmail.com wrote:
Consider the first fit strategy for
Consider the first fit strategy for online bin packing.
So if you have N bins numbered 1, 2, 3..N and you are given value V,
you scan them from left to right and insert V into the first bin that
currently has enough capacity.
In the naieve case, N insertions will take O(N^2) time.
How can this
