Approximation algorithm for the Multicovering Problem.
Abbass GorgiMourad El OualiAnand SrivastavMohamed HachimiPublished in: CoRR (2020)
Keyphrases
- learning algorithm
- computational complexity
- k means
- detection algorithm
- preprocessing
- segmentation algorithm
- high accuracy
- particle swarm optimization
- improved algorithm
- selection algorithm
- convergence rate
- error bounds
- times faster
- matching algorithm
- optimization algorithm
- computationally efficient
- dynamic programming
- optimal solution
- objective function
- data sets
- computational cost
- np hard
- tree structure
- monte carlo
- lower bound
- path planning
- closed form
- similarity measure
- face recognition
- genetic algorithm