SOS Lower Bound for Exact Planted Clique.
Shuo PangPublished in: Computational Complexity Conference (2021)
Keyphrases
- lower bound
- upper bound
- exact and approximate
- branch and bound algorithm
- exact solution
- branch and bound
- lower and upper bounds
- optimal solution
- worst case
- objective function
- np hard
- upper and lower bounds
- maximum clique
- polynomial approximation
- linear programming relaxation
- maximum weight
- competitive ratio
- sufficiently accurate
- online learning
- independent set
- branch and bound method
- lower bounding
- data sets
- lagrangian relaxation
- random access
- data structure
- vc dimension