A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.
Marc BenkertJoachim GudmundssonChristian KnauerRené van OostrumAlexander WolffPublished in: Int. J. Comput. Geom. Appl. (2009)
Keyphrases
- polynomial time approximation
- learning algorithm
- optimization algorithm
- np hard
- computational cost
- preprocessing
- dynamic programming
- detection algorithm
- matching algorithm
- computational complexity
- segmentation algorithm
- bin packing
- convergence rate
- error bounds
- convex hull
- theoretical analysis
- worst case
- probabilistic model
- k means
- optimal solution
- data structure
- greedy algorithm
- cost function
- neural network