A $\frac{5}{2}$-approximation algorithm for coloring rooted subtrees of a degree 3 tree.
Anuj RawatMark A. ShaymanPublished in: J. Comb. Optim. (2020)
Keyphrases
- tree structure
- learning algorithm
- detection algorithm
- computational cost
- theoretical analysis
- computational complexity
- k means
- binary tree
- dynamic programming
- worst case
- tree structures
- probabilistic model
- preprocessing
- segmentation algorithm
- objective function
- constant factor
- approximation ratio
- randomized algorithm
- error bounds
- closed form
- matching algorithm
- optimization algorithm
- expectation maximization
- simulated annealing
- np hard
- multi objective
- lower bound
- optimal solution