poly(n) algorithm for the parameterized Convex Recoloring problem.
Igor RazgonPublished in: Inf. Process. Lett. (2007)
Keyphrases
- k means
- optimization algorithm
- cost function
- times faster
- objective function
- computationally efficient
- detection algorithm
- globally optimal
- computational cost
- memory requirements
- search space
- preprocessing
- convergence rate
- convex hull
- improved algorithm
- estimation algorithm
- worst case
- expectation maximization
- learning algorithm
- experimental evaluation
- significant improvement
- optimal solution
- theoretical analysis
- classification algorithm
- scheduling problem
- computational complexity
- similarity measure