Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs.
David AdjiashviliPublished in: SODA (2017)
Keyphrases
- weight function
- tree structure
- continuous functions
- tree structures
- total cost
- database
- error bounds
- tree nodes
- cost savings
- binary tree
- relative error
- approximation error
- tree search
- hypervolume indicator
- satisfy the triangle inequality
- approximation algorithms
- closed form
- search algorithm
- genetic algorithm
- neural network