Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.
Martin BöhmFranziska EberleNicole MegowLukas NölkeJens SchlöterBertrand SimonAndreas WiesePublished in: CoRR (2020)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- test problems
- exact algorithms
- optimization problems
- theoretical analysis
- dynamic environments
- np hard problems
- neural network
- significant improvement
- learning algorithm
- computational cost
- computationally efficient
- np hard
- computational complexity
- data structure
- objective function
- bicriteria