Showing a limited preview of this publication:
The problem of packing rectangles into several strips is considered. It is shown that for this problem there exist on-line algorithms with multiplicative error asymptotically close to 2e, where e is the base of the natural logarithm. It is proved that none of the on-line algorithms can have the asymptotic multiplicative error less than e.
Received: 2007-January-16
Published Online: 2007-12-10
Published in Print: 2007-12-11
© de Gruyter
