Steiner Tree Approximation via Iterative Randomized Rounding.
Jaroslaw ByrkaFabrizio GrandoniThomas RothvoßLaura SanitàPublished in: J. ACM (2013)
Keyphrases
- steiner tree
- linear programming relaxation
- approximation algorithms
- linear programming
- knapsack problem
- facility location
- lower bound
- mixed integer
- minimum spanning tree
- branch and bound
- np hard
- randomized algorithm
- shortest path
- column generation
- integer program
- feasible solution
- integer programming
- mixed integer programming
- objective function
- valid inequalities
- decision making
- branch and bound algorithm
- random walk
- dynamic programming