A storage-size selection problem
Information Processing Letters - Lecture Notes in Computer Science, no. 173
A simple on-line bin-packing algorithm
Journal of the ACM (JACM)
SIAM Journal on Computing
Online variable-sized bin packing
Discrete Applied Mathematics
On-line bin packing in linear time
Journal of Algorithms
An on-line algorithm for variable-sized bin packing
Acta Informatica
Improved bounds for harmonic-based bin packing algorithms
Discrete Applied Mathematics - Special volume: combinatorics and theoretical computer science
Does randomization help in on-line bin packing?
Information Processing Letters
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
New Algorithms for Bin Packing
Journal of the ACM (JACM)
Resource Augmentation for Online Bounded Space Bin Packing
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the Online Bin Packing Problem
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing
ICALP '00 Proceedings of the 27th 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
On the fractal beauty of bin packing
On the fractal beauty of bin packing
Fast algorithms for bin packing
Journal of Computer and System Sciences
On variable sized vector packing
Acta Cybernetica
Online bin packing with resource augmentation
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Online bin packing with resource augmentation
Discrete Optimization
| Hi-index | 0.00 |
In the variable-sized online bin packing problem, one has to assign items to bins one by one. The bins are drawn from some fixed set of sizes, and the goal is to minimize the sum of the sizes of the bins used. We present new algorithms for this problem and show upper bounds for them which improve on the best previous upper bounds. We also show the first general lower bounds for this problem. The case where bins of two sizes, 1 and 驴 驴 (0, 1), are used is studied in detail. This investigation leads us to the discovery of several interesting fractal-like curves. Our techniques are also applicable to the closely related resource augmented online bin packing problem, where we have also obtained the first general lower bounds.