Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution.
Karl BringmannAlejandro CassisPublished in: CoRR (2022)
Keyphrases
- times faster
- computationally efficient
- upper bound
- optimization problems
- memory efficient
- mesh connected
- orders of magnitude faster
- graph theory
- recently developed
- benchmark datasets
- theoretical analysis
- significant improvement
- computational complexity
- data structure
- machine learning
- computational cost
- dynamic programming
- machine learning algorithms
- computationally expensive
- greedy algorithm
- decision trees
- computer vision
- neural network