1.5-Approximation Algorithm for the 2-Convex Recoloring Problem.
Reuven Bar-YehudaGilad KutielDror RawitzPublished in: IWOCA (2015)
Keyphrases
- improved algorithm
- k means
- high accuracy
- learning algorithm
- objective function
- computational complexity
- search space
- np hard
- matching algorithm
- monte carlo
- detection algorithm
- theoretical analysis
- convex hull
- times faster
- segmentation algorithm
- probabilistic model
- computational cost
- optimal solution
- optimization algorithm
- clustering method
- approximation ratio
- experimental evaluation
- dynamic programming
- closed form
- clustering algorithm
- error tolerance
- worst case
- approximation schemes
- globally optimal
- error bounds
- reinforcement learning
- tree structure
- ant colony optimization
- genetic algorithm
- expectation maximization