We study an on-line bin packing problem. A fixed number n of bins, possibly of different sizes, are given. The items arrive on-line, and the goal is to pack as many items as possible. It is known that there exists a legal packing of the whole sequence in the n bins. We consider fair algorithms that reject an item, only if it does not fit in the empty space of any bin. We show that the competitive ratio of any fair, deterministic algorithm lies between 1/2 and 2/3, and that a class of algorithms including Best-Fit has a competitive ratio of exactly (Formula Presented).
|Title of host publication||Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings|
|Editors||Oscar H. Ibarra, Louxin Zhang|
|Number of pages||9|
|ISBN (Print)||354043996X, 9783540439967|
|State||Published - 2002|
|Event||8th Annual International Conference on Computing and Combinatorics, COCOON 2002 - Singapore, Singapore|
Duration: 15 Aug 2002 → 17 Aug 2002
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||8th Annual International Conference on Computing and Combinatorics, COCOON 2002|
|Period||15/08/02 → 17/08/02|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)