Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: a short proof of a 1.55 upper bound
Deeparnab ChakrabartyJochen KönemannDavid PritchardPublished in: CoRR (2010)
Keyphrases
- linear programming relaxation
- steiner tree
- integrality gap
- upper bound
- lower bound
- branch and bound
- tight upper and lower bounds
- branch and bound algorithm
- worst case
- knapsack problem
- np hard
- linear programming
- lower and upper bounds
- optimal solution
- column generation
- objective function
- lagrangian relaxation
- mixed integer programming
- constant factor
- cutting plane
- integer programming formulation
- arbitrarily close
- feasible solution
- constraint satisfaction
- np complete