An Optimal Algorithm for Dynamic Post-office Problem in R21 and Related Problems.
Sergei BespamyatnikhPublished in: CCCG (1996)
Keyphrases
- related problems
- dynamic programming
- optimal solution
- experimental evaluation
- preprocessing
- closed form
- k means
- high accuracy
- times faster
- search space
- improved algorithm
- cost function
- locally optimal
- exhaustive search
- np hard
- globally optimal
- computational complexity
- expectation maximization
- path planning
- matching algorithm
- clustering method
- detection algorithm
- computationally efficient
- data sets
- linear programming
- probabilistic model
- objective function
- optimization algorithm
- dynamic environments
- recognition algorithm
- significant improvement
- similarity measure