Improved Approximation Algorithm for Convex Recoloring of Trees.
Reuven Bar-YehudaIdo FeldmanDror RawitzPublished in: WAOA (2005)
Keyphrases
- improved algorithm
- computational complexity
- np hard
- dynamic programming
- detection algorithm
- error bounds
- convex hull
- preprocessing
- closed form
- piecewise linear
- experimental evaluation
- tree structure
- computational cost
- matching algorithm
- optimization algorithm
- expectation maximization
- learning algorithm
- cost function
- search space
- high accuracy
- globally optimal
- compact representations
- convergence rate
- probabilistic model
- k means
- search algorithm
- objective function