An Approximation Algorithm for the Smallest Color-Spanning Circle Problem.
Yin WangYinfeng XuPublished in: COCOON (2015)
Keyphrases
- computational complexity
- cost function
- experimental evaluation
- matching algorithm
- times faster
- closed form
- detection algorithm
- theoretical analysis
- linear programming
- worst case
- dynamic programming
- learning algorithm
- preprocessing
- computational cost
- error bounds
- np hard
- particle swarm optimization
- k means
- segmentation algorithm
- optimization algorithm
- search space
- approximation ratio
- randomized algorithm
- maximum likelihood
- high accuracy
- probabilistic model
- significant improvement