Improved Approximation Algorithm for Convex Recoloring of Trees.
Reuven Bar-YehudaIdo FeldmanDror RawitzPublished in: Theory Comput. Syst. (2008)
Keyphrases
- detection algorithm
- optimization algorithm
- improved algorithm
- worst case
- matching algorithm
- optimal solution
- np hard
- dynamic programming
- objective function
- learning algorithm
- significant improvement
- experimental evaluation
- times faster
- globally optimal
- preprocessing
- recognition algorithm
- error bounds
- theoretical analysis
- piecewise linear
- closed form
- approximation methods
- tree structure
- clustering method
- neural network
- linear programming
- convex hull
- probabilistic model
- approximation algorithms
- computational cost
- k means
- data structure
- similarity measure
- binary tree
- genetic algorithm