A Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy.
Nir HalmanPublished in: APPROX-RANDOM (2016)
Keyphrases
- polynomial time approximation
- np hard
- optimal solution
- approximation algorithms
- error bounds
- feasible solution
- knapsack problem
- vertex cover
- bin packing
- approximation guarantees
- approximation schemes
- dynamic programming
- upper bound
- lower bound
- reinforcement learning
- scheduling problem
- evolutionary algorithm
- search algorithm
- objective function