- Author
- Year
- 2015
- Title
- Hardness of approximation for Knapsack problems
- Journal
- Theory of Computing Systems
- Volume | Issue number
- 56 | 2
- Pages (from-to)
- 372-393
- Number of pages
- 21
- Document type
- Article
- Faculty
- Interfacultary Research
- Institute
- Institute for Logic, Language and Computation (ILLC)
- Abstract
- We show various hardness results for knapsack and related problems; in particular we will show that unless the Exponential-Time Hypothesis is false, subset-sum 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 and subset-sum, that can be adapted to work for small space, or in small parallel time.
- URL
- go to publisher's site
- Language
- English
- Persistent Identifier
- https://hdl.handle.net/11245/1.374357
- Downloads
-
10.1007_s00224-014-9550-z(Final published version)
Disclaimer/Complaints regulations
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.