Tighter Bounds for Graph Steiner Tree Approximation.
Gabriel RobinsAlexander ZelikovskyPublished in: SIAM J. Discret. Math. (2005)
Keyphrases
- steiner tree
- linear programming relaxation
- lower bound
- upper bound
- minimum spanning tree
- constant factor
- error bounds
- linear programming
- knapsack problem
- facility location
- lower and upper bounds
- shortest path
- worst case
- branch and bound
- graph theory
- valid inequalities
- error tolerance
- integer programming
- approximation algorithms
- spanning tree
- mixed integer programming
- directed graph
- column generation
- integer program
- np hard
- directed acyclic graph
- branch and bound algorithm
- feasible solution
- random walk
- objective function