An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem.
Zvi GalilOded MargalitPublished in: ICALP (1991)
Keyphrases
- dynamic programming
- high accuracy
- worst case
- improved algorithm
- simulated annealing
- experimental evaluation
- recognition algorithm
- times faster
- detection algorithm
- optimization algorithm
- learning algorithm
- computational cost
- expectation maximization
- k means
- significant improvement
- estimation algorithm
- selection algorithm
- greedy algorithms
- convergence rate
- computationally efficient
- np hard
- preprocessing
- data structure