Hardness of Approximation for Knapsack Problems
Crossref DOI link: https://doi.org/10.1007/s00224-014-9550-z
Published Online: 2014-06-15
Published Print: 2015-02
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Buhrman, Harry
Loff, Bruno
Torenvliet, Leen
Text and Data Mining valid from 2014-06-15
