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.
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.
- Bin packing
- Online algorithms
- Resource augmentation
ASJC Scopus subject areas
- Theoretical Computer Science
- Computational Theory and Mathematics
- Applied Mathematics