An O(n) bin-packing algorithm for uniformly distributed data
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[2] Ulrich Hoffmann,et al. A class of simple stochastic online bin packing algorithms , 1982, Computing.
[3] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..
[4] János Csirik. Bin packing as a random walk: A note on knödel's paper , 1986 .
[5] Walter Knödel,et al. A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic Limit , 1981, MFCS.
[6] Greg N. Frederickson,et al. Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms , 1980, Inf. Process. Lett..
[7] David S. Johnson,et al. Computers and Inrracrobiliry: A Guide ro the Theory of NP-Completeness , 1979 .
[8] Frank Thomson Leighton,et al. Some unexpected expected behavior results for bin packing , 1984, STOC '84.
[9] Walter Knödel. Über das mittlere Verhalten von on-line-Packungsalgorithmen , 1983, J. Inf. Process. Cybern..