An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem.
Nimrod MegiddoEitan ZemelPublished in: J. Algorithms (1986)
Keyphrases
- worst case
- cost function
- times faster
- computational cost
- learning algorithm
- preprocessing
- dynamic programming
- high accuracy
- np hard
- significant improvement
- objective function
- selection algorithm
- recognition algorithm
- expectation maximization
- matching algorithm
- weighted distance
- similarity measure
- tree structure
- ant colony optimization
- clustering method
- theoretical analysis
- linear programming
- simulated annealing
- genetic algorithm
- probabilistic model