Sciweavers

DAM
2008

Random-order bin packing

13 years 11 months ago
Random-order bin packing
ct The average case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [?], Kenyon introduced the random-order ratio, a new average case performance metric for bin packing heuristics, and gave upper and lower bounds for it for he Best Fit heuristics. We introduce an alternative definition of the random-order ratio and show that the two definitions give the same result for Next Fit. We also show that the random-order ratio of Next Fit equals to its asymptotic worst case, i.e., it is 2.
Edward G. Coffman Jr., János Csirik, Lajos
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where DAM
Authors Edward G. Coffman Jr., János Csirik, Lajos Rónyai, Ambrus Zsbán
Comments (0)