Tight lower bounds for the complexity of multicoloring.
Marthe BonamyLukasz KowalikMichal PilipczukArkadiusz SocalaMarcin WrochnaPublished in: CoRR (2016)
Keyphrases
- lower bound
- worst case
- upper bound
- branch and bound algorithm
- complexity measures
- average case complexity
- complexity analysis
- branch and bound
- np hard
- lower and upper bounds
- optimal solution
- space complexity
- decision problems
- memory requirements
- objective function
- information systems
- special case
- search algorithm
- max sat
- lower bounding
- data structure