Lower Bounds for On-line Graph Coloring.
Magnús M. HalldórssonMario SzegedyPublished in: On-Line Algorithms (1991)
Keyphrases
- graph coloring
- lower bound
- max sat
- combinatorial problems
- branch and bound algorithm
- upper bound
- np complete problems
- job shop scheduling
- constraint satisfaction problems
- branch and bound
- phase transition
- np hard
- worst case
- hyper heuristics
- objective function
- constraint programming
- constraint satisfaction
- scheduling problem
- sat solvers
- optimal solution
- genetic programming
- satisfiability problem
- search space
- heuristic search
- tabu search
- metaheuristic
- dynamic programming
- artificial bee colony
- cost function
- learning algorithm