An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem.
Zvi GalilOded MargalitPublished in: SIAM J. Comput. (1991)
Keyphrases
- detection algorithm
- dynamic programming
- optimization algorithm
- worst case
- learning algorithm
- search space
- significant improvement
- np hard
- greedy algorithms
- neural network
- improved algorithm
- high accuracy
- cost function
- experimental evaluation
- preprocessing
- probabilistic model
- computationally efficient
- optimal solution
- computational complexity
- recognition algorithm
- times faster
- objective function
- linear space
- knapsack problem
- memory requirements
- convex hull
- clustering method
- segmentation algorithm
- expectation maximization
- k means