A fast approximation algorithm for the multicovering problem.
Nicholas G. HallDorit S. HochbaumPublished in: Discret. Appl. Math. (1986)
Keyphrases
- experimental evaluation
- times faster
- learning algorithm
- closed form
- high accuracy
- improved algorithm
- clustering method
- detection algorithm
- k means
- simulated annealing
- dynamic programming
- markov random field
- segmentation algorithm
- data sets
- computational cost
- preprocessing
- computational complexity
- optimal solution
- cost function
- significant improvement
- theoretical analysis
- lower bound
- optimization algorithm
- ant colony optimization
- monte carlo
- matching algorithm
- search algorithm
- recognition algorithm
- selection algorithm
- neural network