Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear LP-Rounding.
Lixin LiuHaitao JiangPeiqiang LiuBinhai ZhuDaming ZhuPublished in: ISBRA (2019)
Keyphrases
- approximation algorithms
- integrality gap
- linear programming relaxation
- linear programming
- np hard
- quadratic program
- mixed integer
- linear program
- knapsack problem
- np hardness
- integer programming
- special case
- numerical integration
- pairwise
- closed form
- valid inequalities
- lower bound
- lp norm
- worst case
- primal dual
- objective function
- approximation error
- constant factor
- linear approximation
- taylor series
- maximum number
- ensemble learning
- agnostic learning
- computational complexity
- error bounds
- taylor series expansion
- column generation
- approximation methods
- mixed integer programming
- convex hull
- np complete
- optimal solution
- relative error
- combining multiple
- phase transition
- branch and bound
- control system