×

Fast algorithms for bin packing. (English) Zbl 0284.68023


MSC:

68N01 General topics in the theory of software
68P20 Information storage and retrieval of data
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Adel’son-Vel’skii, G. M.; Landis, Ye. M., An algorithm for the organization of information, Soviet Math. Dokl., 3, 1259-1262 (1962)
[2] Brown, A. R., (Optimum Packing and Depletion (1971), Macdonald and American Elsevier Inc.: Macdonald and American Elsevier Inc. New York) · Zbl 0268.90034
[3] Cook, S. A., The Complexity of Theorem-Proving Procedures, (Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing (1971)) · Zbl 0363.68125
[4] A. Demers; A. Demers
[5] Garey, M. R.; Graham, R. L.; Ullman, J. D., Worst-Case Analysis of Memory Allocation Algorithms, (Proceedings of the 4th Annual ACM Symposium on the Theory of Computing (1972)) · Zbl 0357.68027
[6] Johnson, D. S., Approximation Algorithms for Combinatorial Problems, (Proceedings of the 4th Annual ACM Symposium on the Theory of Computing (1973)) · Zbl 0382.05001
[7] Johnson, D. S., Near-Optimal Allocation Algorithms, (Ph.D. Dissertation (June 1973), Massachusetts Institute of Technology: Massachusetts Institute of Technology Cambridge, MA)
[8] D. S. Johnson, J. D. Ullman, A. Demers, R. L. Graham, and M. R. Garey; D. S. Johnson, J. D. Ullman, A. Demers, R. L. Graham, and M. R. Garey
[9] Karp, R. M., Reducibility Among Combinatorial Problems, (Miller, R. E.; Thatcher, J. W., Complexity of Computer Computations (1972), Plenum Press: Plenum Press New York) · Zbl 0366.68041
[10] Nievergel, J.; Reingold, E. M., Binary Search Trees of Bounded Balance, (Proceedings of the 4th Annual ACM Symposium on the Theory of Computing (1972)) · Zbl 0262.68012
[11] Ullman, J. D., The Performance of a Memory Allocation Algorithm, (Technical Report No. 100 (1971), Princeton University: Princeton University Princeton, NJ) · Zbl 0261.68013
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.