A 2-approximation algorithm for path coloring on a restricted class of trees of rings.
Xiaotie DengGuojun LiWenan ZangYi ZhouPublished in: J. Algorithms (2003)
Keyphrases
- experimental evaluation
- cost function
- learning algorithm
- shortest path problem
- detection algorithm
- optimization algorithm
- dynamic programming
- high accuracy
- linear programming
- multi class classification
- tree structure
- expectation maximization
- probabilistic model
- computational cost
- np hard
- approximation ratio
- computational complexity
- objective function
- decision trees
- genetic algorithm
- optimal path
- boolean expressions
- error bounds
- closed form
- theoretical analysis
- simulated annealing
- k means
- preprocessing