Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The Accommodating Function - A Generalization of the Competitive Ratio
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
On-line Packing and Covering Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
The Accommodating Function -- a generalization of the competitive ratio
The Accommodating Function -- a generalization of the competitive ratio
Throughput-competitive on-line routing
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
On-line admission control and circuit routing for high performance computing and communication
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Extending the Accommodating Function
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On-Line Edge-Coloring with a Fixed Number of Colors
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
| Hi-index | 0.00 |
We consider the Unrestricted Bin Packing problem where we have bins of equal size and a sequence of items. The goal is to maximize the number of items that are packed in the bins by an on-line algorithm. We investigate the power of performing admission control on the items, i.e., rejecting items while there is enough space to pack them, versus behaving fairly, i.e., rejecting an item only when there is not enough space to pack it. We show that by performing admission control on the items, we get better performance for various measures compared with the performance achieved on the fair version of the problem. Our main result shows that we can pack 2/3 of the items for sequences in which the optimal can pack all the items.