On Lower Bounds of Approximating Parameterized k-Clique.
Bingkai LinXuandi RenYican SunXiuhan WangPublished in: CoRR (2021)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- objective function
- worst case
- vc dimension
- lower and upper bounds
- np hard
- optimal solution
- randomly generated problems
- maximum clique
- neural network
- upper and lower bounds
- learning theory
- max sat
- linear programming relaxation
- quadratic assignment problem
- maximum weight
- independent set
- set of randomly generated instances