A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients.
Yang YangPublished in: CoRR (2024)
Keyphrases
- worst case
- computational complexity
- computational cost
- dynamic programming
- learning algorithm
- preprocessing
- significant improvement
- experimental evaluation
- optimal solution
- weighting coefficients
- space complexity
- segmentation algorithm
- expectation maximization
- theoretical analysis
- optimization algorithm
- detection algorithm
- times faster
- recognition algorithm
- high accuracy
- computationally efficient
- probabilistic model
- clustering method
- convergence rate
- np hard
- complexity analysis
- high computational complexity
- matching pursuit
- cost function