1.5-approximation algorithm for the 2-Convex Recoloring problem.
Reuven Bar-YehudaGilad KutielDror RawitzPublished in: Discret. Appl. Math. (2018)
Keyphrases
- learning algorithm
- computational cost
- detection algorithm
- k means
- times faster
- computational complexity
- optimization algorithm
- significant improvement
- probabilistic model
- convex hull
- closed form
- experimental evaluation
- improved algorithm
- worst case
- expectation maximization
- dynamic programming
- search space
- monte carlo
- globally optimal
- computationally efficient
- convergence rate
- recognition algorithm
- error bounds
- approximation ratio
- matching algorithm
- segmentation algorithm
- lower bound
- similarity measure
- decision trees
- feature selection