Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
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.
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Minghong Fang, Zifan Zhang, et al.
CCS 2024
Ravi Kumar, Jasmine Novak, et al.
World Wide Web
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering