In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an algorithm were given the entire input in advance, it could give an optimal solution (in exponential time). Instead of giving the algorithm more knowledge about the input, in this paper we consider the effects of giving an online bin packing algorithm larger bins than the offline algorithm it is compared to. We give new algorithms for this problem that combine items in bins in an unusual way and give bounds on their performance which improve upon the best possible bounded space algorithm. We also give general lower bounds for this problem which are nearly matching for bin sizes b ≥ 2.
|Number of pages||13|
|Journal||Lecture Notes in Computer Science|
|State||Published - 2005|
|Event||Second International Workshop on Approximation and Online Algorithms, WAOA 2004 - Bergen, Norway|
Duration: 14 Sep 2004 → 16 Sep 2004
Bibliographical noteFunding Information:
The first author’s research was supported by Israel Science Foundation (grant no. 250/01). The second author’s research was supported by the Netherlands Organization for Scientific Research (NWO), project number SION 612-061-000.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)