Janos Csirik
David S. Johnson
Abstract
In this article we present a theoretical analysis of the online Sum-of-Squares algorithm (SS) for bin packing along with several new variants. SS is applicable to any instance of bin packing in which the bin capacity B and item sizes s(a) are integral (or can be scaled to be so), and runs in time O(nB). It performs remarkably well from an average case point of view: For any discrete distribution in which the optimal expected waste is sublinear, SS also has sublinear expected waste. For any discrete distribution where the optimal expected waste is bounded, SS has expected waste at most O(log n). We also discuss several interesting variants on SS, including a randomized O(nB log B)-time online algorithm SS* whose expected behavior is essentially optimal for all discrete distributions. Algorithm SS* depends on a new linear-programming-based pseudopolynomial-time algorithm for solving the NP-hard problem of determining, given a discrete distribution F, just what is the growth rate for the optimal expected waste.
- Albers, S., and Mitzenmacher, M. 1998. Average-case analyses of first fit and random fit bin-packing. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, Philadelphia, PA, 290--299.]] Google Scholar
Digital Library
- Alon, N., and Spencer, J. H. 1992. The Probabilistic Method. Wiley Interscience, New York, NY.]]Google Scholar
- Applegate, D. L., Buriol, L., Dillard, B., Johnson, D. S., and Shor, P. W. 2003. The cutting-stock approach to bin-packing: Theory and experiments. In Proceedings of the 5th Workshop on Algorithm Engineering and Experimentation. SIAM, Philadelphia, PA, 1--15.]]Google Scholar
- Coffman, Jr., E. G., Courcoubetis, C., Garey, M. R., Johnson, D. S., McGeoch, L. A., Shor, P. W., Weber, R. R., and Yannakakis, M. 1991. Fundamental discrepancies between average-case analyses under discrete and continuous distributions. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing. ACM, New York, 230--240.]] Google ScholarDigital Library
- Coffman, Jr., E. G., Courcoubetis, C., Garey, M. R., Johnson, D. S., Shor, P. W., Weber, R. R., and Yannakakis, M. 2000. Bin packing with discrete item sizes, Part I: Perfect packing theorems and the average case behavior of optimal packings. SIAM J. Disc. Math. 13, 384--402.]] Google ScholarDigital Library
- Coffman, Jr., E. G., Courcoubetis, C., Garey, M. R., Johnson, D. S., Shor, P. W., Weber, R. R., and Yannakakis, M. 2002. Perfect packing theorems and the average-case behavior of optimal and online bin-packing. SIAM Review 44, 95--108. (Updated version of Coffman, Jr. et al. {200}).]] Google ScholarDigital Library
- Coffman, Jr., E. G., Johnson, D. S., McGeoch, L. A., Shor, P. W., and Weber, R. R. 2005. Bin packing with discrete item sizes, Part III: Average case behavior of FFD and BFD. In preparation.]]Google Scholar
- Coffman, Jr., E. G., Johnson, D. S., Shor, P. W., and Weber, R. R. 1993. Markov chains, computer proofs, and average-case analysis of Best Fit bin-packing. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing. ACM, New York, 412--421.]] Google ScholarDigital Library
- Coffman, Jr., E. G., Johnson, D. S., Shor, P. W., and Weber, R. R. 1997. Bin packing with discrete item sizes, Part II: Tight bounds on first fit. Rand. Struct. Alg. 10, 69--101.]] Google ScholarDigital Library
- Courcoubetis, C., and Weber, R. R. 1990. Stability of online bin-packing with random arrivals and long-run average constraints. Prob. Eng. Inf. Sci. 4, 447--460.]]Google ScholarCross Ref
- Csirik, J., Johnson, D. S., and Kenyon., C. 2001. Better approximation algorithms for bin covering. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, Philadelphia, PA, 557--566.]] Google ScholarDigital Library
- Csirik, J., Johnson, D. S., and Kenyon, C. 2005. On the worst-case performance of the sum-of-squares algorithm for bin-packing. E-Print arXiv:cs.DS/0509031, arXiv.org e-Print archive (http://arxiv.org/archive/cs).]]Google Scholar
- Csirik, J., Johnson, D. S., Kenyon, C., Shor, P. W., and Weber, R. R. 1999. A self organizing bin-packing heuristic. In Proceedings 1999 Workshop on Algorithm Engineering and Experimentation, M. Goodrich and C. C. McGeoch, Eds. Lecture Notes in Computer Science, vol. 1619, Springer-Verlag, Berlin, Germany, 246--265.]] Google ScholarDigital Library
- Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York.]] Google ScholarDigital Library
- Gilmore, P. C., and Gomory, R. E. 1961. A linear programming approach to the cutting stock problem. Oper. Res. 9, 849--859.]]Google ScholarDigital Library
- Gilmore, P. C., and Gomory, R. E. 1963. A linear programming approach to the cutting stock program---Part II. Oper. Res. 11, 863--888.]]Google ScholarDigital Library
- Grötschel, M., Lovasz, L., and Schrijver, A. 1981. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169--197.]]Google ScholarCross Ref
- Hajek, B. 1982. Hitting-time and occupation-time bounds implied by drift analysis with applications. Adv. Appl. Prob. 14, 502--525.]]Google ScholarCross Ref
- 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, 299--325.]]Google ScholarDigital Library
- Karmarkar, N., and Karp, R. M. 1982. An efficient approximation scheme for the one-dimensional bin-packing problem. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, Los Alamitos, Calif., 312--320.]]Google Scholar
- Karp, R. M., and Papadimitriou, C. H. 1982. On the linear characterization of combinatorial optimization problems. SIAM J. Comput. 11, 620--632.]]Google ScholarCross Ref
- Kenyon, C., and Mitzenmacher, M. 2002. Linear waste of best fit bin-packing on skewed distributions. Random Structures and Algorithms 20, 441--464. (Preliminary version in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, Las Alamitos, CA, 2000, 582--589.)]] Google ScholarDigital Library
- Kenyon, C., Rabani, Y., and Sinclair, A. 1998. Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin-packing. J. Algorithms 27, 218--235. (Preliminary version in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, Philadelphia, PA, 1996, 351--358.)]] Google ScholarDigital Library
- Rhee, W. T. 1988. Optimal bin-packing with items of random sizes. Math. Oper. Res. 13, 140--151.]]Google ScholarCross Ref
- Rhee, W. T., and Talagrand, M. 1993a. On line bin-packing with items of random size. Math. Oper. Res. 18, 438--445.]]Google ScholarDigital Library
- Rhee, W. T., and Talagrand, M. 1993b. On line bin-packing with items of random sizes---II. SIAM J. Comput. 22, 1251--1256.]] Google ScholarDigital Library
- Vaidya, P. M. 1989. Speeding-up linear programming using fast matrix multiplication. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, Los Alamitos, CA, 332--337.]]Google ScholarDigital Library
- Valério de Carvalho, J. M. 1999. Exact solutions of bin-packing problems using column generation and branch and bound. Ann. Oper. Res. 86, 629--659.]]Google ScholarCross Ref
- van Vliet, A. 1992. An improved lower bound for online bin-packing algorithms. Inf. Proc. Lett. 43, 277--284.]] Google ScholarDigital Library
Index Terms
- On the Sum-of-Squares algorithm for bin packing
Recommendations
Approximating Bin Packing within O(log OPT * Log Log OPT) Bins
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceFor bin packing, the input consists of n items with sizes between 0 and 1, which have to be assigned to a minimum number of bins of size 1. The seminal Karmarkar-Karp algorithm from '82 produces a solution with at most OPT + O(log2 OPT) bins. We provide ...
Improved approximation algorithm for two-dimensional bin packing
SODA '14: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithmsWe study the two-dimensional bin packing problem with and without rotations. Here we are given a set of two-dimensional rectangular items I and the goal is to pack these into a minimum number of unit square bins. We consider the orthogonal packing case ...
Sum-of-squares heuristics for bin packing and memory allocation
The sum-of-squares algorithm (SS) was introduced by Csirik, Johnson, Kenyon, Shor, and Weber for online bin packing of integral-sized items into integral-sized bins. First, we show the results of experiments from two new variants of the SS algorithm. ...
Comments