Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Paper
Multidimensional on-line bin packing: Algorithms and worst-case analysis
Abstract
We consider the problem of packing rectangles into bins which are unit squares. We give an on-line algorithm that uses at most 3.25 times the optimal number of bins. We also prove a result for the case when the items to be packed are squares and discuss extensions to higher dimensions. © 1989.
Related
Conference paper
Characterization of line width variation
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications
Conference paper
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009