Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
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.
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
Jaione Tirapu Azpiroz, Alan E. Rosenbluth, et al.
SPIE Photomask Technology + EUV Lithography 2009