An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems.
Chenchen WuDonglei DuDachuan XuPublished in: COCOON (2013)
Keyphrases
- semidefinite programming
- linear programming
- learning algorithm
- dynamic programming
- primal dual
- objective function
- computational complexity
- interior point
- optimal solution
- np hard
- linear programming problems
- approximation algorithms
- linear program
- semidefinite
- interior point methods
- improved algorithm
- worst case
- feature extraction