An approximation algorithm for k-center problem on a convex polygon.
Hai DuYinfeng XuPublished in: J. Comb. Optim. (2014)
Keyphrases
- convex hull
- times faster
- learning algorithm
- polygonal approximation
- cost function
- experimental evaluation
- worst case
- optimal solution
- high accuracy
- linear programming
- approximation ratio
- tree structure
- improved algorithm
- segmentation algorithm
- dynamic programming
- objective function
- computationally efficient
- detection algorithm
- np hard
- recognition algorithm
- preprocessing
- globally optimal
- theoretical analysis
- approximation algorithms
- error bounds
- ant colony optimization
- energy function
- input data
- significant improvement
- similarity measure