Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
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.
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991
Peter Wendt
Electronic Imaging: Advanced Devices and Systems 1990
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis