A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set.
Parinya ChalermsookDaniel VazPublished in: Electron. Notes Discret. Math. (2016)
Keyphrases
- independent set
- integrality gap
- maximum weight
- linear programming relaxation
- linear program
- lp relaxation
- linear programming
- np hard
- arbitrarily close
- lower bound
- bipartite graph
- approximation algorithms
- valid inequalities
- knapsack problem
- integer programming
- finite number
- partial order
- optimal solution
- column generation
- minimum weight
- feasible solution
- primal dual
- message passing
- branch and bound
- integer program
- mixed integer programming
- weighted graph
- objective function
- mixed integer
- traveling salesman problem
- data exchange
- collaborative filtering