Two lower bounds for $p$-centered colorings.
Loïc DuboisGwenaël JoretGuillem PerarnauMarcin PilipczukFrançois PitoisPublished in: Discret. Math. Theor. Comput. Sci. (2020)
Keyphrases
- lower bound
- upper bound
- graph coloring
- branch and bound algorithm
- max sat
- branch and bound
- lower bounding
- lower and upper bounds
- worst case
- objective function
- np hard
- quadratic assignment problem
- upper and lower bounds
- vc dimension
- optimal solution
- data sets
- optimal cost
- lagrangian relaxation
- sample complexity
- dynamic time warping