Show that any online bin-packing algorithm can be forced to use at least 32 theoptimal
Chapter 10, Problem 10.8(choose chapter or problem)
Show that any online bin-packing algorithm can be forced to use at least 32 theoptimal number of bins, by considering the following sequence of items: N itemsof size 16 2, N items of size 13 + , N items of size 12 +
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer