Author:
Korte Bernhard,Vygen Jens
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Coffman, E.G., Garey, M.R., and Johnson, D.S. [ 1996 ]: Approximation algorithms for bin-packing; a survey. In: Approximation Algorithms for NP-Hard Problems ( D.S. Hochbaum, ed.), PWS, Boston, 1996
2. Baker, B.S. [ 1985 ]: A new proof for the First-Fit Decreasing bin-packing algorithm. Journal of Algorithms 6 (1985), 49–70
3. Eisemann, K. [ 1957 ]: The trim problem. Management Science 3 (1957), 279–284
4. Fernandez de la Vega, W., and Lueker, G.S. [ 1981 ]: Bin packing can be solved within 1+6 in linear time. Combinatorica 1 (1981), 349–355
5. Garey, M.R., Graham, R.L., Johnson, D.S., and Yao, A.C. [ 1976 ]: Resource constrained scheduling as generalized bin packing. Journal of Combinatorial Theory A 21 (1976), 257–298
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献