Disjoint Cycles: Integrality Gap, Hardness, and Approximation.
Mohammad R. SalavatipourJacques VerstraëtePublished in: IPCO (2005)
Keyphrases
- integrality gap
- linear programming relaxation
- np hardness
- agnostic learning
- linear program
- approximation algorithms
- lower bound
- np hard
- arbitrarily close
- valid inequalities
- low degree
- primal dual
- linear programming
- feasible solution
- upper bound
- approximation guarantees
- integer programming
- worst case
- finite number
- uniform distribution
- pairwise
- integer programming formulation
- knapsack problem
- branch and bound
- mixed integer
- cutting plane
- lp relaxation
- special case
- learning theory
- integer program
- quadratic assignment problem
- triangle inequality
- lower and upper bounds
- phase transition
- dynamic programming
- scheduling problem
- objective function