Bin packing with divisible item sizes
Journal of Complexity
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
Bin packing with discrete item sizes, part II: tight bounds on first fit
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
Online computation and competitive analysis
Online computation and competitive analysis
Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
On the online bin packing problem
Journal of the ACM (JACM)
Resource augmentation for online bounded space bin packing
Journal of Algorithms
On-line Packing and Covering Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
Speed is as powerful as clairvoyance [scheduling problems]
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Windows scheduling as a restricted version of Bin Packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic bin packing of unit fractions items
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Online bin packing with resource augmentation
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Dynamic bin packing of unit fractions items
Theoretical Computer Science
Hi-index | 0.00 |
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson [7]. This problem is a generalization of the bin packing problem in which items may arrive and depart from the packing dynamically. The main result in this paper is a lower bound of 2.5 on the achievable competitive ratio, improving the best known 2.428 lower bound [3], and revealing that packing items of restricted form like unit fractions (i.e., of size 1/k for some integer k), which can guarantee a competitive ratio 2.4985 [3], is indeed easier. We also investigate the resource augmentation analysis on the problem where the on-line algorithm can use bins of size b ( 1) times that of the optimal off-line algorithm. An interesting result is that we prove b = 2 is both necessary and sufficient for the on-line algorithm to match the performance of the optimal off-line algorithm, i.e., achieve 1-competitiveness. Further analysis is made to give a trade-off between the bin size multiplier b and the achievable competitive ratio.