A 3/2-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts.
Samuel FioriniMartin GroßJochen KönemannLaura SanitàPublished in: CoRR (2017)
Keyphrases
- tree structure
- dynamic programming
- search space
- cost function
- computational cost
- optimal solution
- worst case
- error bounds
- closed form
- detection algorithm
- learning algorithm
- preprocessing
- spanning tree
- data structure
- convergence rate
- binary tree
- approximation ratio
- probabilistic model
- convex hull
- simulated annealing
- computational complexity
- objective function
- similarity measure