-Lower Bound for Approximating the Parameterized k-Clique.
Yijia ChenYi FengBundit LaekhanukitYanlin LiuPublished in: CoRR (2023)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- branch and bound
- lower and upper bounds
- optimal solution
- worst case
- maximum clique
- lower bounding
- upper and lower bounds
- np hard
- e learning
- sample complexity
- simulated annealing
- linear programming relaxation
- online algorithms
- competitive ratio
- data sets
- polynomial approximation