Tight Approximation for Variants of Directed Steiner Tree via State-Tree Decomposition and Linear Programming Rounding.
Xiangyu GuoBundit LaekhanukitShi LiJiayi XianPublished in: CoRR (2019)
Keyphrases
- linear programming
- tree decomposition
- linear programming relaxation
- steiner tree
- approximation algorithms
- linear program
- tree width
- lower bound
- np hard
- decomposition method
- optimal solution
- primal dual
- probabilistic reasoning
- worst case
- parallel processing
- column generation
- branch and bound
- video sequences
- integer programming
- constraint networks
- feasible solution
- heuristic search
- constraint satisfaction problems
- objective function