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

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 analyzed. Withn assumed known in advance, one such algorithm is described and shown to waste θ(n2/3) space on the average. It is proved that this result also characterizes optimal on-line shelf packings. For a very general class of linear-time algorithms, it is shown that a constant (nonzero) fraction of the space must be wasted on the average for alln, and a lower bound on this fraction in terms of algorithm parameters is given. Finally, the paper discusses the implications of the above results for dynamic packing and two-dimensional bin-packing problems.

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

[2]  David S. Johnson,et al.  Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

[3]  Edward G. Coffman,et al.  Dynamic Bin Packing , 1983, SIAM J. Comput..

[4]  Robert E. Tarjan,et al.  Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..

[5]  N. Fisher,et al.  Probability Inequalities for Sums of Bounded Random Variables , 1994 .

[6]  Shlomo Halfin.  NEXT-FIT BIN PACKING WITH RANDOM PIECE SIZES , 1989 .

[7]  Edward G. Coffman,et al.  First-fit allocation of queues: tight probabilistic bounds on wasted space , 1990 .

[8]  N. Karmarkar.  Probabilistic analysis of some bin-packing problems , 1982, FOCS 1982.

[9]  Joaquin Miller,et al.  Columbus , 1910 .

[10]  John H. Vande Vate,et al.  Expected performance of the shelf heuristic for 2-dimensional packing , 1989 .

[11]  Jeffrey C. Lagarias,et al.  Algorithms for Packing Squares: A Probabilistic Analysis , 1989, SIAM J. Comput..

[12]  Micha Hofri.  Two-Dimensional Packing: Expected Performance of Simple Level Algorithms , 1980, Inf. Control..

[13]  G. S. Lueker.  An average-case analysis of bin packing with uniformly distributed item sizes , 1982 .

[14]  Kazuhiro Tsuga,et al.  Average-case analysis of the Modified Harmonic algorithm , 1989, Algorithmica.

[15]  Frank Thomson Leighton,et al.  A provably efficient algorithm for dynamic storage allocation , 1986, STOC '86.

[16]  Richard M. Karp,et al.  A probabilistic analysis of multidimensional bin packing problems , 1984, STOC '84.

[17]  P.W. Shor,et al.  The average-case analysis of some on-line algorithms for bin packing , 1984, Comb..

[18]  Frank Thomson Leighton,et al.  Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms , 1986, STOC '86.

[19]  G. S. Lueker,et al.  Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics , 1988 .

[20]  Brenda S. Baker,et al.  Shelf Algorithms for Two-Dimensional Packing Problems , 1983, SIAM J. Comput..

[21]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[22]  Kazuhiro Tsuga,et al.  Average-Case Analysis of the Modified Marmonic Algorithm , 1986, FSTTCS.

[23]  J. Durbin.  Distribution theory for tests based on the sample distribution function , 1973 .

[24]  Peter W. Shor.  The average-case analysis of some on-line algorithms for bin packing , 1986, Comb..

[25]  Ulrich Hoffmann,et al.  A class of simple stochastic online bin packing algorithms , 1982, Computing.

[26]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .