Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
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.
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Harpreet S. Sawhney
IS&T/SPIE Electronic Imaging 1994