Probabilistic bounds for dual bin-packing
Acta Informatica
Online algorithms for a dual version of bin packing
Discrete Applied Mathematics
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Online computation and competitive analysis
Online computation and competitive analysis
A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On-line load balancing for related machines
Journal of Algorithms
The Accommodating Function: A Generalization of the Competitive Ratio
SIAM Journal on Computing
Developments from a June 1996 seminar on Online algorithms: the state of the art
On-line Packing and Covering Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
Fast algorithms for packing problems.
Fast algorithms for packing problems.
SIGACT news online algorithms column 8
ACM SIGACT News
On the sum minimization version of the online bin covering problem
Discrete Applied Mathematics
| Hi-index | 0.00 |
We study an on-line bin packing problem. A fixed number n of bins, possibly of different sizes, are given. The items arrive on-line, and the goal is to pack as many items as possible. It is known that there exists a legal packing of the whole sequence in the n bins. We consider fair algorithms that reject an item, only if it does not fit in the empty space of any bin. We show that the competitive ratio of any fair, deterministic algorithm lies between ½ and 2/3, and that a class of algorithms including Best-Fit has a competitive ratio of exactly n/2n-1.