Author:
Eggermont Christian E. J.,Woeginger Gerhard J.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference11 articles.
1. Coffman, E.G. Jr., Garey, M.R., Johnson, D.S.: Bin packing with divisible item sizes. J. Complex. 3, 406–428 (1987)
2. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)
3. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
4. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)
5. Magazine, M., Nemhauser, G.L., Trotter, L.E.: When the greedy solution solves a class of knapsack problems. Oper. Res. 23, 207–217 (1975)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献