论文信息 - Random-order bin packing

Random-order bin packing

The average-case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [C. Kenyon, Best-fit bin-packing with random order, in: Proc. of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 1996, pp. 359-364] 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 the 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.

[1] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .

[2] C. Kenyon. Best-fit bin-packing with random order , 1996, SODA '96.

[3] Joan Boyar,et al. The relative worst order ratio for online algorithms , 2007, TALG.

[4] Micha Hofri,et al. A Stochastic Model of Bin-Packing , 1980, Inf. Control..

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] Joan Boyar,et al. The Relative Worst Order Ratio for On-Line Algorithms , 2003, CIAC.

[7] Jeffrey D. Ullman,et al. Worst-case analysis of memory allocation algorithms , 1972, STOC.

[8] Edward G. Coffman,et al. Probabilistic analysis of packing and partitioning algorithms , 1991, Wiley-Interscience series in discrete mathematics and optimization.