Baker, B. S.; Coffman, E. G. jun. A tight asymptotic bound for next-fit-decreasing bin-packing. (English) Zbl 0496.68049 SIAM J. Algebraic Discrete Methods 2, 147-152 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 23 Documents MSC: 68R99 Discrete mathematics in relation to computer science Keywords:relative performance of the next-fit-decreasing approximation rule for classical one-dimensional bin-packing PDFBibTeX XMLCite \textit{B. S. Baker} and \textit{E. G. Coffman jun.}, SIAM J. Algebraic Discrete Methods 2, 147--152 (1981; Zbl 0496.68049) Full Text: DOI References: [1] Aho, A. V.; Sloane, N. J. A., Some doubly exponential sequences, Fibonacci Quart., 11, 429, (1973) · Zbl 0277.10011 [2] Garey, M. R.; Graham, R. L.; Johnson, D. S.; Yao, A. C., Resource constrained scheduling as generalized bin packing, J. Combinatorial Theory Ser. A, 21, 257, (1976) · Zbl 0384.90053 [3] Garey, MichaelR.; Johnson, DavidS., Computers and intractability, (1979) · Zbl 0411.68039 [4] Golomb, S., On certain nonlinear recurring sequences, Amer. Math. Monthly, 70, 403, (1963) · Zbl 0139.26705 [5] Johnson, DavidS., Fast algorithms for bin packing, J. Comput. System Sci., 8, 272, (1974) · Zbl 0284.68023 [6] Johnson, D. S.; Demers, A.; Ullman, J. D.; Garey, M. R.; Graham, R. L., Worst-case performance bounds for simple one-dimensional packing algorithms, SIAM J. Comput., 3, 299, (1974) · Zbl 0297.68028 · doi:10.1137/0203025 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.