On Lower Bounds of Approximating Parameterized k-Clique.
Bingkai LinXuandi RenYican SunXiuhan WangPublished in: ICALP (2022)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- lower and upper bounds
- lower bounding
- np hard
- worst case
- vc dimension
- max sat
- linear programming relaxation
- online algorithms
- optimal solution
- maximum clique
- quadratic assignment problem
- maximum weight
- randomly generated problems
- independent set
- sample complexity
- data sets
- data structure