Approximate Covering with Lower and Upper Bounds via LP Rounding.
Sayan BandyapadhyayAniket Basu RoyPublished in: CoRR (2020)
Keyphrases
- lower and upper bounds
- linear programming
- lower bound
- upper bound
- valid inequalities
- exact and approximate
- linear programming relaxation
- mixed integer
- lagrangian relaxation
- upper and lower bounds
- lower bounding
- optimal solution
- linear program
- approximation algorithms
- feasible solution
- exact solution
- objective function
- lagrangian dual
- branch and bound
- itemsets
- column generation
- nonlinear programming
- worst case
- np hard