Springer
doi.org/10.1007/s00224-014-9550-z
Theory of Computing Systems
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