Don Coppersmith, Ephraim Feig, et al.
IEEE TSP
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.
Don Coppersmith, Ephraim Feig, et al.
IEEE TSP
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Harpreet S. Sawhney
IS&T/SPIE Electronic Imaging 1994