A Faster FPTAS for Knapsack Problem With Cardinality Constraint.
Wenxin LiJoohyun LeeNess B. ShroffPublished in: CoRR (2019)
Keyphrases
- knapsack problem
- cardinality constraints
- lp relaxation
- optimal solution
- dynamic programming
- optimization problems
- np hard
- exact algorithms
- greedy algorithm
- functional dependencies
- approximation algorithms
- entity relationship
- integrity constraints
- database schema
- np complete
- implicit enumeration
- database systems
- cutting plane
- special case
- evolutionary algorithm