A lower bound for on-line vector-packing algorithms

Galambos Gábor and Kellerer Hans and Woeginger Gerhard J.: A lower bound for on-line vector-packing algorithms. In: Acta cybernetica, (11) 1-2. pp. 23-34. (1993)

[thumbnail of cybernetica_011_numb_001_002_023-034.pdf]
Cikk, tanulmány, mű

Download (667kB) | Preview


In this paper we deal with the vector-packing problem which is a generalization of the well known one-dimensional bin-packing problem to higher dimensions. We give the first, non-trivial lower bounds on the asymptotic worst case ratio of any on-line cf-dimensional vector packing algorithm.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 1993
Volume: 11
Number: 1-2
ISSN: 0324-721X
Page Range: pp. 23-34
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38496/
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: 34. 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. 11:03
URI: http://acta.bibl.u-szeged.hu/id/eprint/12518

Actions (login required)

View Item View Item