On the sum-of-squares algorithm for bin packing

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 208-217

  Csirik, Janos ^a   Johnson, David S ^b   Kenyon, Claire ^c   Orlin, James B ^d   Shor, Peter W ^b   Weber, Richard R ^e  

^a UNIVERSITY OF SZEGED   (Hungary)

^b AT AND T LABS RESEARCH   (United States)

^c UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^e UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM FOR SOLVING; AVERAGE CASE; BIN PACKING; DISCRETE DISTRIBUTION; FIXED SIZE; ON-LINE ALGORITHMS; POINT OF VIEWS; SUM OF SQUARES; PSEUDO-POLYNOMIAL TIME ALGORITHMS; SUM-OF-SQUARES ALGORITHMS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; INTEGER PROGRAMMING; LINEAR PROGRAMMING; ONLINE SYSTEMS; POLYNOMIALS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

BINS; ALGORITHMS;

EID: 0033715163     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335331     Document Type: Conference Paper

References (18)

1. S. Albers and M. Mitzenmacher. Average-case analyses of first fit and random fit bin packing. In Proc. Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 290-299, Philadelphia, 1998. Society for Industrial and Applied Mathematics.
2. E. G. Coffman, Jr., C. Courcoubetis, M. R. Garey, D. S. Johnson, L. A. McGeoch, P. W. Shor, R. R. Weber, and M. Yannakakis. Fundamental discrepancies between average-case analyses under discrete and continuous distributions. In Proceedings 23rd Annual ACM Symposium on Theory of Computing, pages 230-240, New York, 1991. ACM Press.
3. E. G. Coffman, Jr., C. Courcoubetis, M. R. Garey, D. S. Johnson, P. W. Shot, R. R. Weber, and M. Yannakakis. Bin packing with discrete item sizes, Part I: Perfect packing theorems and the average case behavior of optimal packings. SIAM J. Disc. Math. To appear.
4. E. G. Coffman, Jr., D. S. Johnson, L. A. McGeoch, P. W. Shor, and R. R. Weber. Bin packing with discrete item sizes, Part III: Average-case behavior of FFD and BFD. In preparation.
5. E. G. Coffman, Jr., D. S. Johnson, P. W. Shor, and R. R. Weber. Markov chains, computer proofs, and average-case analysis of Best Fit bin packing. In Proceedings 25th Annual ACM Symposium on Theory of Computing, pages 412-421, New York, 1993. ACM Press.
6. E. G. Coffman, Jr., D. S. Johnson, P. W. Shor, and R. R. Weber. Bin packing with discrete item sizes, Part II: Tight bounds on First Fit. Random Structures and Algorithms, 10:69-101, 1997.
7. C. Courcoubetis and R. R. Weber. Stability of on-line bin packing with random arrivals and long-run average constraints. Prob. Eng. Inf. Sci., 4:447-460, 1990.
8. J. Csirik, D. S. Johnson, C. Kenyon, P. W. Shor, and R. R. Weber. A self organizing bin packing heuristic. In M. Goodrich and C. C. McGeoch, editors, Proceedings 1999 Workshop on Algorithm Engineering and Experimentation, pages 246-265, Berlin, 1999. Lecture Notes in Computer Science 1619, Springer-Verlag.
9. W. Fernandez de la Vega and G. S. Lueker. Bin packing can be solved within 1+ε in linear time. Combinatorica, 1:349-355, 1981.
10. B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications. Adv. Appl. Prob., 14:502-525, 1982.
11. N. Karmarkar and R. M. Karp. An efficient approximation scheme for the one-dimensional bin packing problem. In Proc. 23rd Ann. Symp. on Foundations of Computer Science, pages 312-320, 1982. IEEE Computer Soc.
12. C. Kenyon, Y. Rabani, and A. Sinclair. Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing. J. Algorithms, 27:218-235, 1998.
13. Preliminary version under the same title appeared in Proc. Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 351-358, 1996.
14. W. T. Rhee. Optimal bin packing with items of random sizes. Math. Oper. Res., 13:140-151, 1988.
15. W. T. Rhee and M. Talagrand. On line bin packing with items of random size. Math. Oper. Res., 18:438-445, 1993.
16. W. T. Rhee and M. Talagrand. On line bin packing with items of random sizes - II. SIAM J. Comput., 22:1251-1256, 1993.
17. P. M. Vaidya. Speeding-up linear programming using fast matrix multiplication. In Proceedings, The 30th Annual Symposium on Foundations of Computer Science, pages 332-337, Los Alamitos, CA, 1989. IEEE Computer Society Press.
18. D. B. Wilson. Personal communication, 2000.