A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Hardness of Approximation for Knapsack Problems
2014
Theory of Computing Systems
Preserved Fulltext
Hardness of approximation for Knapsack problems Buhrman, H.M.; Loff, B.F.L.; Torenvliet, L. Abstract We show various hardness results for knapsack and related problems; in particular we will show that unless the Exponential-Time Hypothesis is false, subsetsum cannot be approximated any better than with an FPTAS. We also provide new unconditional lower bounds for approximating knapsack in Ketan Mulmuley's parallel PRAM model. Furthermore, we give a simple new algorithm for approximating knapsack
doi:10.1007/s00224-014-9550-z
fatcat:qwgirc5sifa6flvmb7imrkcmpi