An Optimal Algorithm for the On-Line Closest-Pair Problem.
Christian SchwarzMichiel H. M. SmidJack SnoeyinkPublished in: Algorithmica (1994)
Keyphrases
- dynamic programming
- np hard
- learning algorithm
- optimal solution
- computational complexity
- worst case
- computational cost
- objective function
- preprocessing
- detection algorithm
- linear programming
- improved algorithm
- optimization algorithm
- expectation maximization
- cost function
- high accuracy
- globally optimal
- input data
- experimental evaluation
- theoretical analysis
- space complexity
- exhaustive search
- tree structure
- convex hull
- optimal strategy
- motion estimation
- piecewise linear
- data structure
- recognition algorithm
- closed form
- path planning
- ant colony optimization
- significant improvement
- neural network
- simulated annealing
- mobile robot