A 5/2-Approximation Algorithm for Coloring Rooted Subtrees of a Degree 3 Tree.
Anuj RawatPublished in: CoRR (2018)
Keyphrases
- tree structure
- learning algorithm
- computational complexity
- dynamic programming
- optimization algorithm
- np hard
- worst case
- experimental evaluation
- tree construction
- optimal solution
- high accuracy
- closed form
- computational cost
- segmentation algorithm
- matching algorithm
- binary tree
- significant improvement
- k means
- linear programming
- preprocessing
- detection algorithm
- frequent patterns
- recognition algorithm
- suffix tree
- neural network