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 |
| Summary: | 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. |
|---|---|
| Physical Description: | 23-34 |
| ISSN: | 0324-721X |