2014-06-01
Hardness of Approximation for Knapsack Problems
Publication
Publication
Additional Metadata | |
---|---|
Life Sciences (theme 5), Logistics (theme 3) | |
Springer | |
Theory of Computing Systems | |
Networks | |
This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/024.002.003 - Networks | |
Organisation | Algorithms and Complexity |
Buhrman, H.M, Loff Barreto, B. S, & Torenvliet, L. (2014). Hardness of Approximation for Knapsack Problems. Theory of Computing Systems.
|