A lower bound for on-line vector-packing algorithms

Gábor Galambos; Hans Kellerer; Gerhard J. Woeginger

Skip to main content Skip to main navigation menu Skip to site footer

A lower bound for on-line vector-packing algorithms

Gábor Galambos
Hans Kellerer
Gerhard J. Woeginger

Downloads

Download data is not yet available.

PDF

Published

1993-01-01

How to Cite

Galambos, G., Kellerer, H., & Woeginger, G. J. (1993). A lower bound for on-line vector-packing algorithms. Acta Cybernetica, 11(1-2), 23-34. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3418

Download Citation

Issue

Vol 11 No 1-2 (1993)

Section

Regular articles

Most read articles by the same author(s)

János Csirik, Gábor Galambos, On the expected behaviour of the NF algorithm for a dual bin-packing problem , Acta Cybernetica: Vol 8 No 1 (1987)
Gábor Galambos, A 1.6 lower-bound for the two-dimensional on-line rectangle bin-packing , Acta Cybernetica: Vol 10 No 1-2 (1991)
Gerhard J. Woeginger, Computing maximum valued regions , Acta Cybernetica: Vol 10 No 4 (1992)
Ulrich Pferschy, Gerhard J. Woeginger, En-Yu Yao, Partitioning graphs into two trees , Acta Cybernetica: Vol 11 No 3 (1994)
Günter Rote, Gerhard J. Woeginger, Minimizing the number of tardy jobs on a single machine with batch setup times , Acta Cybernetica: Vol 13 No 4 (1998)
Luitpold Babel, Gerhard J. Woeginger, Pseudo-hamiltonian graphs , Acta Cybernetica: Vol 14 No 4 (2000)
Gerhard J. Woeginger, Jiří Sgall, The complexity of coloring graphs without long induced paths , Acta Cybernetica: Vol 15 No 1 (2001)
Petra Schuur, Gerhard J. Woeginger, A PTAS for single machine scheduling with controllable processing times , Acta Cybernetica: Vol 15 No 3 (2002)
Gerhard J. Woeginger, An algorithmic comparison of three scientific impact indices , Acta Cybernetica: Vol 19 No 3 (2010)
Christian Eggermont, Cor Hurkens, Gerhard J. Woeginger, Realizing small tournaments through few permutations , Acta Cybernetica: Vol 21 No 2 (2013)