Polynomial Time Approximation Schemes for Geometric Optimization Problems in Euclidean Metric Spaces.
Richard MayrAnnette ScheltenPublished in: Lectures on Proof Verification and Approximation Algorithms (1997)
Keyphrases
- metric space
- approximation schemes
- approximation algorithms
- optimization problems
- euclidean space
- similarity search
- distance function
- special case
- evolutionary algorithm
- high dimensional
- np hard
- similarity queries
- range queries
- worst case
- metaheuristic
- objective function
- searching in metric spaces
- probability measures
- access methods
- euclidean distance
- partially ordered sets
- point sets
- computational complexity
- multidimensional index
- knn
- vector space
- similarity join
- numerical methods
- combinatorial optimization
- neural network
- lower bound
- computer vision