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