Steven S. Seiden
Abstract
A new framework for analyzing online bin packing algorithms is presented. This framework presents a unified way of explaining the performance of algorithms based on the Harmonic approach. Within this framework, it is shown that a new algorithm, Harmonic++, has asymptotic performance ratio at most 1.58889. It is also shown that the analysis of Harmonic+1 presented in Richey [1991] is incorrect; this is a fundamental logical flaw, not an error in calculation or an omitted case. The asymptotic performance ratio of Harmonic+1 is at least 1.59217. Thus, Harmonic++ provides the best upper bound for the online bin packing problem to date.
- Brown, D. J.1979. A lower bound for on-line one-dimensional bin packing algorithms. Tech. Rep. R-864, Coordinated Sci. Lab., University of Illinois at Urbana-Champaign, Urbana, Ill.Google Scholar
- Coffman, E. G., Garey, M. R., and Johnson, D. S. 1997. Approximation algorithms for bin packing: A survey. In Approximation Algorithms for NP-hard Problems, D. Hochbaum, Ed. PWS Publishing Company, Chap. 2. Google Scholar
- Csirik, J.1989. An on-line algorithm for variable-sized bin packing. Acta Info. 26 (8), 697--709. Google Scholar
- Csirik, J., and Woeginger, G. 1998. On-line packing and covering problems. In On-Line Algorithms---The State of the Art, A. Fiat and G. Woeginger, Eds. Lecture Notes in Computer Science, Springer-Verlag, New York, Chap. 7. Google Scholar
- Csirik, J., and Woeginger, G.2000. Resource augmentation for online bounded space bin packing. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming (July). pp. 296--304.Google Scholar
- Johnson, D. S.1974. Fast algorithms for bin packing. J. Comput. Syst. Sci. 8, 272--314.Google Scholar
- Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., and Graham, R. L.1974. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3, 256--278.Google Scholar
- Lee, C., and Lee, D.1985. A simple on-line bin-packing algorithm. J. ACM 32, 3 (July), 562--572. Google Scholar
- Liang, F. M.1980. A lower bound for online bin packing. Info. Proc. Lett. 10, 76--79.Google Scholar
- Ramanan, P., Brown, D., Lee, C., and Lee, D.1989. On-line bin packing in linear time. J. Algorithms 10, 3 (Sept.), 305--326. Google Scholar
- Richey, M. B.1991. Improved bounds for harmonic-based bin packing algorithms. Discr. Appli. Math. 34, 203--227. Google Scholar
- Seiden, S. S.2001. An optimal online algorithm for bounded space variable-sized bin packing. SIAM J. Discr. Math. 14, 4, 458--470. Google Scholar
- Ullman, J. D.1971. The performance of a memory allocation algorithm. Tech. Rep. 100, Princeton University, Princeton, N.J., Oct.Google Scholar
- van Vliet, A.1992. An improved lower bound for online bin packing algorithms. Info. Proc. Lett. 43, 5 (Oct.), 277--284. Google Scholar
- Yao, A. C. C.1980. New algorithms for bin packing. J. ACM 27, 207--227. Google Scholar
Index Terms
- On the online bin packing problem
Recommendations
Online Results for Black and White Bin Packing
In online bin packing problems, items of sizes in [0, 1] are to be partitioned into subsets of total size at most 1, called bins. We introduce a new variant where items are of two types, called black and white, and the item types must alternate in each ...
Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing
In this paper, we study 1-space bounded multi-dimensional bin packing and hypercube packing. A sequence of items arrive over time, each item is a d -dimensional hyperbox (in bin packing) or hypercube (in hypercube packing), and the length of each side ...
Online Bin Packing with Cardinality Constraints
We consider a one-dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items $k\geq 2$. This defines the (standard) bin packing problem with cardinality constraints, which is an important ...
Comments