Simulative Analysis of Access Selection Algorithms for Multi-Access Networks
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
Bin packing with controllable item sizes
Information and Computation
New lower bounds for certain classes of bin packing algorithms
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Efficient lower bounds and heuristics for the variable cost and size bin packing problem
Computers and Operations Research
Variable sized online interval coloring with bandwidth
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Online bin packing with cardinality constraints
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Vector bin packing with multiple-choice
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Automating the packing heuristic design process with genetic programming
Evolutionary Computation
Vector bin packing with multiple-choice
Discrete Applied Mathematics
New lower bounds for certain classes of bin packing algorithms
Theoretical Computer Science
Tight bounds for online vector bin packing
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| 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 in which bins of two sizes, 1 and $\alpha \in (0,1)$, are used is studied in detail. This investigation leads us to the discovery of several interesting fractal-like curves.