![Dynamic programming / Operations research / Complexity classes / Approximation algorithms / Polynomial-time approximation scheme / Knapsack problem / Subset sum problem / Parameterized complexity / Optimization problem / Theoretical computer science / Computational complexity theory / Applied mathematics Dynamic programming / Operations research / Complexity classes / Approximation algorithms / Polynomial-time approximation scheme / Knapsack problem / Subset sum problem / Parameterized complexity / Optimization problem / Theoretical computer science / Computational complexity theory / Applied mathematics](https://www.pdfsearch.io/img/59cfeaa26e35322e53f757af1c4971e2.jpg) Date: 2010-12-30 12:50:07Dynamic programming Operations research Complexity classes Approximation algorithms Polynomial-time approximation scheme Knapsack problem Subset sum problem Parameterized complexity Optimization problem Theoretical computer science Computational complexity theory Applied mathematics | | There is No EPTAS for Two-dimensional Knapsack Ariel Kulik∗ Hadas Shachnai† AbstractAdd to Reading ListSource URL: www.cs.technion.ac.ilDownload Document from Source Website File Size: 161,20 KBShare Document on Facebook
|