1 |
Johnson, D. S. (1973), Near-Optimal Bin Packing Algorithms, Technical Report MACTR-109, Project MAC, Massachusetts Institute of Technology, Cambridge, Mass
|
2 |
Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., and Graham, R. L. (1974), Worst-Case Performance Bound for Simple One-Dimensional Packing Algorithms, SIAM Journal of Computing, 3(4), 299-326
DOI
|
3 |
Coffman, E. G., Garey, M. R., and Johnson, D. S. (1996), Approximation Algorithm for Bin-Packing : A Survey, Approximation Algorithms for NP-Hard Problem, D. Hochbaum, PWS Publishing, Boston, 46-93
|
4 |
Graham, R. L. (1969), Bounds on Multiprocessing Timing Anomalies, SIAM Journal Appl. Math., 17(2)
|
5 |
Coffman, E. G., Garey, M. R., and Johnson, D. S. (1983), Approximation Algorithms for Bin-Packing-An Updated Survey, Bell Laboratories, Murray Hill, NJ, 49-106
|
6 |
Baker, B. S. (1983), A New Proof for the First-Fit Decreasing Bin-Packing Algorithm, Technical Memorandum, Bell Laboratories, Murray Hill, NJ 07974
|