Tight Lower Bounds for the Complexity of Multicoloring.
Marthe BonamyLukasz KowalikMichal PilipczukArkadiusz SocalaMarcin WrochnaPublished in: ACM Trans. Comput. Theory (2019)
Keyphrases
- lower bound
- worst case
- upper bound
- complexity measures
- branch and bound algorithm
- average case complexity
- np hard
- complexity analysis
- branch and bound
- lower and upper bounds
- computational complexity
- objective function
- lower bounding
- max sat
- bayesian networks
- vc dimension
- sample complexity
- optimal solution
- real time
- linear programming relaxation
- quadratic assignment problem
- space complexity
- optimal cost