Sparsification Lower Bounds for List H-Coloring.
Hubie ChenBart M. P. JansenKarolina OkrasaAstrid PietersePawel RzazewskiPublished in: CoRR (2020)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- np hard
- objective function
- optimal solution
- least squares
- data sets
- set of randomly generated instances
- optimal cost
- worst case
- neural network
- database
- sample size
- tabu search
- sample complexity
- similarity measure
- upper and lower bounds
- lower bounding
- randomly generated problems