Simplified tight analysis of Johnson's algorithm.
Lars EngebretsenPublished in: Inf. Process. Lett. (2004)
Keyphrases
- worst case
- detection algorithm
- computational complexity
- dynamic programming
- np hard
- lower bound
- high accuracy
- experimental evaluation
- search space
- preprocessing
- recognition algorithm
- objective function
- selection algorithm
- estimation algorithm
- computational cost
- experimental study
- ant colony optimization
- classification algorithm
- input data
- cost function
- search algorithm
- optimal solution
- image processing
- least squares
- simulated annealing
- learning algorithm
- particle swarm optimization
- computationally efficient
- k means
- data analysis
- similarity measure
- improved algorithm