论文信息 - A Lower Bound for On-Line One-Dimensional Bin Packing Algorithms.

A Lower Bound for On-Line One-Dimensional Bin Packing Algorithms.

Abstract : This paper is concerned with algorithms for which the pieces (numbers) in list L are available one at a time, and each piece must be placed in some bin before the next piece is available; such an algorithm is referred to as on-line. The performance measure used is the ratio of the number of bins used by an algorithm A in packing list L, A(L), to the optimum (minimum) number of bins required to pack the list, OPT(L).

Donna J. Brown | Donna J. Brown

[1] Igal Golan,et al. Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms , 1981, SIAM J. Comput..

[2] On the Sum of the Reciprocals of the Fermat Numbers and Related Irrationalities , 1963, Canadian Journal of Mathematics.

[3] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[4] Brenda S. Baker,et al. A 5/4 Algorithm for Two-Dimensional Packing , 1981, J. Algorithms.

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

[6] Ronald L. Rivest,et al. Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

[7] Andrew Chi-Chih Yao,et al. New Algorithms for Bin Packing , 1978, JACM.

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

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

[10] Donna J. Brown,et al. An Improved BL Lower Bound , 1980, Inf. Process. Lett..

[11] Solomon W. Golomb,et al. On Certain Nonlinear Recurring Sequences , 1963 .