A 1.6 lower-bound for the two-dimensional on-line rectangle bin-packing

Examining on-line algorithms for the two dimensional rectangle bin packing problem, Coppersmith asked in [2] whether one can give a better lower bound for this type of algorithms than the Liang's bound which is 1.5364... . In this paper we present a bound of 1.6.

Saved in:
Bibliographic Details
Main Author: Galambos Gábor
Format: Article
Published: 1991
Series:Acta cybernetica 10 No. 1-2
Kulcsszavak:Számítástechnika, Kibernetika
Online Access:http://acta.bibl.u-szeged.hu/12489

Similar Items