On the Integrality Gap of the Prize-Collecting Steiner Forest LP.
Jochen KönemannNeil OlverKanstantsin PashkovichR. RaviChaitanya SwamyJens VygenPublished in: APPROX-RANDOM (2017)
Keyphrases
- integrality gap
- prize collecting
- linear programming relaxation
- linear program
- lp relaxation
- linear programming
- valid inequalities
- arbitrarily close
- single machine scheduling problem
- primal dual
- lower bound
- approximation algorithms
- knapsack problem
- feasible solution
- travel time
- integer programming formulation
- optimal solution
- message passing
- finite number
- integer programming
- energy minimization
- column generation
- integer program
- mixed integer
- mixed integer programming
- np hardness
- low degree
- dynamic programming
- approximate solutions
- branch and bound
- global constraints
- upper bound