Hardness of Approximation for Knapsack Problems

2014-06-01

Additional Metadata
THEME	Life Sciences (theme 5), Logistics (theme 3)
Publisher	Springer
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
Organisation	Algorithms and Complexity
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Buhrman, H.M, Loff Barreto, B. S, & Torenvliet, L. (2014). Hardness of Approximation for Knapsack Problems. Theory of Computing Systems.

Publication