Two lower bounds for $p$-centered colorings.
Loïc DuboisGwenaël JoretGuillem PerarnauMarcin PilipczukFrançois PitoisPublished in: CoRR (2020)
Keyphrases
- lower bound
- upper bound
- graph coloring
- branch and bound
- branch and bound algorithm
- np hard
- lower and upper bounds
- max sat
- optimal solution
- combinatorial problems
- vc dimension
- upper and lower bounds
- set of randomly generated instances
- optimal cost
- lower bounding
- quadratic assignment problem
- lagrangian relaxation
- worst case
- objective function
- linear programming relaxation
- inductive inference
- search space
- polynomial approximation
- average case complexity
- neural network