A lower bound for on-line vector-packing algorithms

Most read articles by the same author(s)

• Christian Eggermont, Cor Hurkens, Gerhard J. Woeginger, Realizing small tournaments through few permutations , Acta Cybernetica: Vol. 21 No. 2 (2013)
• Gerhard J. Woeginger, Jiří Sgall, The complexity of coloring graphs without long induced paths , Acta Cybernetica: Vol. 15 No. 1 (2001)
• Gerhard J. Woeginger, An algorithmic comparison of three scientific impact indices , Acta Cybernetica: Vol. 19 No. 3 (2010)
• 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)
• Luitpold Babel, Gerhard J. Woeginger, Pseudo-hamiltonian graphs , Acta Cybernetica: Vol. 14 No. 4 (2000)
• Gerhard J. Woeginger, Computing maximum valued regions , Acta Cybernetica: Vol. 10 No. 4 (1992)
• 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)
• 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)
• Petra Schuur, Gerhard J. Woeginger, A PTAS for single machine scheduling with controllable processing times , Acta Cybernetica: Vol. 15 No. 3 (2002)
• Ulrich Pferschy, Gerhard J. Woeginger, En-Yu Yao, Partitioning graphs into two trees , Acta Cybernetica: Vol. 11 No. 3 (1994)