Packings in two dimensions: Asymptotic average-case analysis of algorithms

@article{Coffman1993PackingsIT,
  title={Packings in two dimensions: Asymptotic average-case analysis of algorithms},
  author={Edward G. Coffman and Peter W. Shor},
  journal={Algorithmica},
  year={1993},
  volume={9},
  pages={253-277}
}
New approximation algorithms for packing rectangles into a semi-infinite strip are introduced in this paper. Within a standard probability model, an asymptotic average-case analysis is given for the wasted space in the packings produced by these algorithms. An off-line algorithm is presented along with a proof that it wastes θ(√/n)space on the average, wheren is the number of rectangles packed. This result is known to apply to optimal packings as well. Several on-line shelf algorithms are also… CONTINUE READING