Better approximation algorithms for bin covering

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 557-566

  Csirik, Janos ^a   Johnson, David S ^b   Kenyon, Claire ^c  

^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)

Author keywords

Algorithms; Measurement; Performance; Theory; Verification

Indexed keywords

EID: 33749567103     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Susanne Albers , Michael Mitzenmacher, Average-case analyses of first fit and random fit bin packing, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.290-299, January 25-27, 1998, San Francisco, California, United States
2. S. B. Assman, D. S. Johnson, D. J. Kleitman, and J. Y- T. Leung. On a dual version of the one-dimensional bin packing problem. J. Algorithms, 5(4):502-525, 1984.
3. S. B. Assmann. Problems in Discrete Applied Mathematics. PhD thesis, Department of Mathematics, MIT, Cambridge, MA, 1983.
4. Leo Breiman, Probability, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1992
5. E. G. Coffman, Jr. , C. Courcoubetis , M. R. Garey , D. S. Johnson , L. A. McGeoch , P. W. Shor , R. R. Weber , M. Yannakakis, Fundamental discrepancies between average-case analyses under discrete and continuous distributions: a bin packing case study, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.230-240, May 05-08, 1991, New Orleans, Louisiana, United States [doi〉10.1145/103418.103446]
6. E. G. Coffman, Jr. , C. Courcoubetis , M. R. Garey , D. S. Johnson , P. W. Shor , R. R. Weber , M. Yannakakis, Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings, SIAM Journal on Discrete Mathematics, v.13 n.3, p.384-402, May-June 2000 [doi〉10.1137/S0895480197325936]
7. C. Courcoubetis and R. R. Weber. Stability of on-line bin packing with random arrivals and long-run average constraints. Prob. Eng. In}'. Sci., 4:447-460, 1990.
8. J. Csirik , J. B. G. Frenk , G. Galambos , A. H. G. Rinnooy Kan, Probabilistic analysis of algorithms for dual bin packing problems, Journal of Algorithms, v.12 n.2, p.189-203, June 1991 [doi〉10.1016/0196-6774(91)90001- F]
9. J. Csirik , J. B. G. Frenk , M. Labbé , S. Zhang, Two simple algorithms for bin covering, Acta Cybernetica, v.14 n.1, p.13-25, Feb 1999
10. Janos Csirik , David S. Johnson , Claire Kenyon , James B. Orlin , Peter W. Shor , Richard R. Weber, On the sum-of-squares algorithm for bin packing, Proceedings of the thirtysecond annual ACM symposium on Theory of computing, p.208-217, May 21-23, 2000, Portland, Oregon, United States [doi〉10.1145/ 335305.335331]
11. János Csirik , David S. Johnson , Claire Kenyon , Peter W. Shor , Richard R. Weber, A Self Organizing Bin Packing Heuristic, Selected papers from the International Workshop on Algorithm Engineering and Experimentation, p.246-265, January 15-16, 1999
12. J. Csirik , V. Totik, Online algorithms for a dual version of bin packing, Discrete Applied Mathematics, v.21 n.2, p.163-167, October 1988 [doi〉10.1016/0166-218X(88)90052-2 ] 13 W. Fernandez de la Vega and G. S. Lueker. Bin packing can be solved within l+e ill linear time. Combinatorica, 1:349-355, 1981.
13. S. Han, D. Hong, and J. Y.-T. Leung. Probabilistic analysis of a bin covering algorithm. Oper. Res. Lett., 18:193-199, 1996.
14. N. Karmarkar and R. M. Karp. An efficient approximation scheme tbr the one-dimensional bin packing problem. In Proe. 23rd Ann. Syrup. on Foundations of Computer Science, pages 312-320, 1982. IEEE Computer Soc.
15. Claire Kenyon , Yuval Rabani , Alistair Sinclair, Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing, Journal of Algorithms, v.27 n.2, p.218-235, May 1, 1998 [doi〉10.1006/jagm.1997.0919 ]
16. Wansoo T. Rhee, A note for optimal bin packing and optimal bin covering with items of random size, SIAM Journal on Computing, v.19 n.4, p.705-710, Aug. 1990 [doi〉10.1137/0219048]
17. W. T. Rhee, M. Talagrand, Optimal bin covering with items of random size, SIAM Journal on Computing, v.18 n.3, p.487-498, June 1989 [doi〉10.1137/ 0218034]