Additional Metadata
THEME Information (theme 2)
Publisher Springer
Persistent URL
Journal Theory of Computing Systems
Project Networks
Grant This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/024.002.003 - Networks
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