A simple on-line bin-packing algorithm
Journal of the ACM (JACM)
On-line bin packing in linear time
Journal of Algorithms
An improved lower bound for on-line bin packing algorithms
Information Processing Letters
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
On the online bin packing problem
Journal of the ACM (JACM)
Resource augmentation for online bounded space bin packing
Journal of Algorithms
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On-line Packing and Covering Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
Worst-case analysis of memory allocation algorithms
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Fast algorithms for bin packing
Journal of Computer and System Sciences
Tight results for Next Fit and Worst Fit with resource augmentation
Theoretical Computer Science
(1 + ε)-competitive algorithm for online OVSF code assignment with resource augmentation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Competitive multi-dimensional dynamic bin packing via l-shape bin packing
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
SIGACT news online algorithms column 20: the power of harmony
ACM SIGACT News
(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation
Journal of Combinatorial Optimization
Hi-index | 0.00 |
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.