Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics
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.
Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics
David L. Shealy, John A. Hoffnagle
SPIE Optical Engineering + Applications 2007
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007