Imran Nasim, Michael E. Henderson
Mathematics
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.
Imran Nasim, Michael E. Henderson
Mathematics
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology