Funder
National Natural Science Foundation of China
Zhejiang Provincial Natural Science Foundation of China
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference11 articles.
1. A new proof for the first-fit decreasing bin-packing algorithm;Baker;Journal of Algorithms,1985
2. Approximation algorithm for bin packing: a survey;Coffman,1997
3. The tight bound of first fit decreasing bin-packing algorithm is FFD(L)≤119OPT(L)+69;Dósa;Lecture Notes in Computer Science,2007
4. Resource constrained scheduling as generalized bin packing;Garey;Journal of Combinatorial Theory, Series A,1976
5. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1978
Cited by
62 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献