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

Galambos Gábor: A 1.6 lower-bound for the two-dimensional on-line rectangle bin-packing. In: Acta cybernetica, (10) 1-2. pp. 21-24. (1991)

[thumbnail of cybernetica_010_numb_001_002_021-024.pdf]
Cikk, tanulmány, mű

Download (542kB) | Preview


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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 1991
Volume: 10
Number: 1-2
ISSN: 0324-721X
Page Range: pp. 21-24
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38493/
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: 24. p. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:26
Last Modified: 2022. Jun. 13. 08:10
URI: http://acta.bibl.u-szeged.hu/id/eprint/12489

Actions (login required)

View Item View Item