Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear Linear Programming-Rounding.
Lixin LiuHaitao JiangPeiqiang LiuBinhai ZhuDaming ZhuPublished in: J. Comput. Biol. (2020)
Keyphrases
- linear programming
- linear programming relaxation
- integrality gap
- np hard
- approximation algorithms
- linear program
- feasible solution
- optimal solution
- primal dual
- column generation
- objective function
- dynamic programming
- numerical integration
- linear approximation
- valid inequalities
- integer programming
- np complete
- quadratic program
- error bounds
- np hardness
- lower bound
- worst case
- taylor series
- quadratic programming
- taylor series expansion
- nonlinear programming
- network flow
- maximum number
- ensemble learning
- absolute error
- combining multiple
- constraint propagation
- knapsack problem
- closed form
- information theoretic
- maximum error
- optimization problems
- special case
- computational complexity