Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing

  • Authors:

  • E. G. Coffman, Jr.;C. Courcoubetis;M. R. Garey;D. S. Johnson;P. W. Shor;R. R. Weber;M. Yannakakis

  • Affiliations:

  • -;-;-;-;-;-;-

  • Venue:
  • SIAM Review
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the one-dimensional bin packing problem under the discrete uniform distributions $U\{j,k\}$, $1 \leq j \leq k-1$, in which the bin capacity is $k$ and item sizes are chosen uniformly from the set $\{1,2,\ldots,j\}$. Note that for $0