Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
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.
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Shu Tezuka
WSC 1991