Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming.
Charles CarlsonAlexandra KollaRay LiNitya ManiBenny SudakovLuca TrevisanPublished in: SIAM J. Discret. Math. (2021)
Keyphrases
- max cut
- semidefinite programming
- lower bound
- np hard
- linear programming
- graph model
- upper bound
- spectral graph
- planar graphs
- primal dual
- graph partitioning
- kernel matrix
- optimal solution
- np complete problems
- branch and bound
- objective function
- linear program
- approximation algorithms
- worst case
- np complete
- maximum margin
- machine learning
- least squares
- clustering algorithm