A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy.
Nir HalmanPublished in: Theor. Comput. Sci. (2016)
Keyphrases
- polynomial time approximation
- np hard
- optimal solution
- approximation algorithms
- error bounds
- vertex cover
- knapsack problem
- dynamic programming
- approximation guarantees
- feasible solution
- integer variables
- bin packing
- scheduling problem
- greedy algorithm
- theoretical analysis
- approximation schemes
- linear programming
- upper bound
- search space
- lower bound