A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem.
Boaz BarakSamuel B. HopkinsJonathan A. KelnerPravesh K. KothariAnkur MoitraAaron PotechinPublished in: SIAM J. Comput. (2019)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- worst case
- objective function
- optimal solution
- lower bounding
- maximum clique
- np hard
- independent set
- lower and upper bounds
- lagrangian relaxation
- quasi cliques
- branch and bound method
- linear programming relaxation
- upper and lower bounds
- neural network
- special case
- maximum weight
- search algorithm
- genetic algorithm
- data sets