A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks.
Michael E. SaksAlex SamorodnitskyLeonid ZosinPublished in: Comb. (2004)
Keyphrases
- integrality gap
- directed networks
- lower bound
- linear programming relaxation
- arbitrarily close
- tight upper and lower bounds
- upper bound
- constant factor
- linear program
- approximation algorithms
- communication delays
- np hard
- valid inequalities
- minimum cost
- branch and bound
- linear programming
- branch and bound algorithm
- column generation
- primal dual
- knapsack problem
- optimal solution
- worst case
- integer programming
- objective function
- maximum flow
- low degree
- mixed integer programming
- lp relaxation
- feasible solution
- lower and upper bounds
- message passing
- traveling salesman problem
- control theory
- search algorithm