Information (theme 2)
Springer
dx.doi.org/10.1007/s00224-014-9550-z
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
Algorithms and Complexity

Buhrman, H.M, Loff Barreto, B. S, & Torenvliet, L. (2015). Hardness of Approximation for Knapsack Problems. Theory of Computing Systems, 56(2), 372–393. doi:10.1007/s00224-014-9550-z