An approximation algorithm for the total covering problem.
Pooya HatamiPublished in: Discuss. Math. Graph Theory (2007)
Keyphrases
- high accuracy
- detection algorithm
- objective function
- significant improvement
- computational cost
- learning algorithm
- preprocessing
- k means
- cost function
- dynamic programming
- particle swarm optimization
- closed form
- times faster
- recognition algorithm
- classification algorithm
- polynomial time approximation
- error bounds
- optimization algorithm
- segmentation algorithm
- worst case
- experimental evaluation
- optimal solution
- computationally efficient
- monte carlo
- upper bound
- probabilistic model
- data structure
- selection algorithm
- improved algorithm
- similarity measure