Best-fit bin-packing with random order

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 359-364

  Kenyon, Claire ^a  

^a UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY;

BEST FIT; BEST-KNOWN ALGORITHMS; BIN PACKING; BIN PACKING ALGORITHM; LOWER BOUNDS; MULTISET; PERFORMANCE RATIO; UPPER BOUND;

BINS;

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

References (19)

1. B. Chandra, Does randomization help in on-line bin-packing? IPL 43, 1, 15-19, 1992.
2. K.L. Clarkson and P.W. Shor. Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental. In Proceedings of the 4th Ann. ACM Symp. on Comput. Geometry, 12-17, 1988.
3. E.G. Coffman, D.S. Johnson, P.W. Shor, R.R. Weber. Markov chains, computer proofs, and average-case analysis of best-fit bin packing. STOC 1993, 412-421.
4. E.G. Coffman, Jr. and George S. Lueker. Probabilistic Analysis of Packing and Partitioning Algorithms. Wiley & Sons, 1991.
5. W. Fernandez de la Vega and G.S. Lueker. Bin Packing can be solved within 1+ϵ in linear time. Combinatorica 1(4) (1981) 349-355.
6. Galambos and Frenk, A simple proof of Liang's lower bound for on-line packing and the extension to the parametric case, Discrete Applied Math, 41, 1993, 173-178.
7. Michael R. Garey and David S. Johnson. Computers and Intractability: a guide to the theory of NP-completeness. Freeman & Co., 1979.
8. D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms, SIAM J. on Computing 3, 229-325 (1974).
9. D.S. Johnson, Fast algorithms for bin-packing, JCSS8, 272-314, 1974.
10. N. Karmakar and R.M. Karp. An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem. FOCS 23 (1982), 312-320.
11. C. Kenyon, Y. Rabani and A. Sinclair. Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing. These proceedings.
12. C.C. Lee and D.T. Lee, A simple on-line packing algorithm, JACM 32, 562-572, 1985.
13. Frank M. Liang, A lower bound for on-line bin-packing, IPL 10,2, 1980.
14. P. Ramanan, D.J. Brown, C.C. Lee and D.T. Lee. Online bin-packing in linear time, J. Alg. 10, 305-326, 1989.
15. W.T. Rhee and M. Talagrand. On Line Bin Packing with Items of Random Size, Mathematics of Operations Research, 18(2), 1993, 438-445.
16. M.B. Richey, Improved bounds for refined harmonic bin packing, unpublished, 1990.
17. P.W. Shor. The average-case analysis of some on-line algorithms for bin packing. Combinatorica 6(2) (1986) 179-200.
18. A. Van Vliet, An improved lower bound for on-line bin packing algorithms, IPL 43, 5, 277-284, 1992.
19. A.C. Yao, New algorithms in bin packing, JACM 27, 207-227, 1980.