A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs .
Zachary FriggstadJochen KönemannMohammad ShadravanPublished in: SWAT (2016)
Keyphrases
- bipartite graph
- steiner tree
- linear programming relaxation
- integrality gap
- lower bound
- worst case
- upper bound
- branch and bound
- knapsack problem
- linear programming
- np hard
- optimal solution
- column generation
- branch and bound algorithm
- link prediction
- mixed integer programming
- integer programming
- integer program
- objective function
- approximation algorithms
- valid inequalities
- feasible solution
- lower and upper bounds
- edge weights
- genetic algorithm
- network flow
- lagrangian relaxation
- greedy algorithm