An Improved Approximation Algorithm for the Most Points Covering Problem.
Hossein GhasemalizadehMohammadreza RazzaziPublished in: Theory Comput. Syst. (2012)
Keyphrases
- np hard
- search space
- cost function
- worst case
- learning algorithm
- approximation ratio
- computational complexity
- preprocessing
- times faster
- k means
- expectation maximization
- convex hull
- dynamic programming
- optimization algorithm
- probabilistic model
- computational cost
- experimental evaluation
- improved algorithm
- polygonal approximation
- high accuracy
- detection algorithm
- clustering method
- polynomial time approximation
- approximation algorithms
- closed form
- theoretical analysis
- simulated annealing
- significant improvement
- lower bound
- optimal solution
- objective function
- similarity measure