A lower bound for on-line vector-packing algorithms
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.
Saved in:
| Main Authors: | |
|---|---|
| Format: | Article |
| Published: |
1993
|
| Series: | Acta cybernetica
11 No. 1-2 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12518 |
| LEADER | 01114nab a2200241 i 4500 | ||
|---|---|---|---|
| 001 | acta12518 | ||
| 005 | 20220613110343.0 | ||
| 008 | 161015s1993 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Galambos Gábor | |
| 245 | 1 | 2 | |a A lower bound for on-line vector-packing algorithms |h [elektronikus dokumentum] / |c Galambos Gábor |
| 260 | |c 1993 | ||
| 300 | |a 23-34 | ||
| 490 | 0 | |a Acta cybernetica |v 11 No. 1-2 | |
| 520 | 3 | |a 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. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 700 | 0 | 1 | |a Kellerer Hans |e aut |
| 700 | 0 | 1 | |a Woeginger Gerhard J. |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12518/1/cybernetica_011_numb_001_002_023-034.pdf |z Dokumentum-elérés |