Lower Bounds for On-Line Graph Coloring.
Magnús M. HalldórssonMario SzegedyPublished in: Theor. Comput. Sci. (1994)
Keyphrases
- graph coloring
- lower bound
- max sat
- combinatorial problems
- branch and bound algorithm
- upper bound
- branch and bound
- job shop scheduling
- np complete problems
- constraint satisfaction problems
- objective function
- phase transition
- scheduling problem
- worst case
- optimal solution
- np hard
- tabu search
- sat solvers
- constraint satisfaction
- hyper heuristics
- combinatorial optimization
- search algorithm
- job shop scheduling problem
- distributed constraint optimization problems