Tight Lower Bounds for the Complexity of Multicoloring.
Marthe BonamyLukasz KowalikMichal PilipczukArkadiusz SocalaMarcin WrochnaPublished in: ESA (2017)
Keyphrases
- lower bound
- worst case
- upper bound
- branch and bound algorithm
- complexity measures
- complexity analysis
- np hard
- average case complexity
- branch and bound
- objective function
- lower bounding
- computational complexity
- upper and lower bounds
- decision problems
- space complexity
- vc dimension
- optimal solution
- maximum likelihood
- computational cost
- data structure
- linear programming relaxation
- optimal cost
- neural network