Bounded space on-line variable-sized bin packing
In this paper we consider the fc-bounded space on-line bin packing problem. Some efficient approximation algorithms are described and analyzed. Selecting either the smallest or the largest available bin size to start a new bin as items arrive turns out to yield a worst-case performance bound of 2. B...
Saved in:
| Main Authors: | |
|---|---|
| Format: | Article |
| Published: |
1997
|
| Series: | Acta cybernetica
13 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12579 |
| Summary: | In this paper we consider the fc-bounded space on-line bin packing problem. Some efficient approximation algorithms are described and analyzed. Selecting either the smallest or the largest available bin size to start a new bin as items arrive turns out to yield a worst-case performance bound of 2. By packing large items into appropriate bins, an efficient approximation algorithm is derived from fc-bounded space on-line bin packing algorithms and its worst-case performance bounds is 1.7 for k > 3. |
|---|---|
| Physical Description: | 63-76 |
| ISSN: | 0324-721X |