A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.
Marc BenkertJoachim GudmundssonChristian KnauerEsther MoetRené van OostrumAlexander WolffPublished in: COCOON (2006)
Keyphrases
- polynomial time approximation
- cost function
- objective function
- preprocessing
- detection algorithm
- dynamic programming
- error bounds
- segmentation algorithm
- np hard
- optimal solution
- computational cost
- worst case
- simulated annealing
- matching algorithm
- expectation maximization
- search space
- mathematical model
- ant colony optimization
- linear programming
- tree structure
- tabu search
- optimization algorithm
- particle swarm optimization
- learning algorithm
- probabilistic model
- similarity measure