论文信息 - A 1.6 Lower-Bound for the Two-Dimensional On-Line Rectangle Bin-Packing

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.

Gábor Galambos

[1] Prabhakar Raghavan,et al. Multidimensional on-line bin packing: Algorithms and worst-case analysis , 1989 .

[2] D. S. Johnson,et al. On Packing Two-Dimensional Bins , 1982 .

[3] Frank M. Liang. A Lower Bound for On-Line Bin Packing , 1980, Inf. Process. Lett..