Abstract
An online bin packing instance is a list of item sizes each of which is a rational number in (0,1], the goal is to partition the items into bins where the total size of items in a bin is at most 1, and the total number of bins is minimized. Here we analyze the ratio of two online algorithms for sequences where the total size of items is large and prove an old open conjecture of Johnson.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
