Worst and Best Case Behaviour of an Approximate Graph Coloring Algorithm.
Karl DürreJohannes HeuftHeinrich MüllerPublished in: WG (1981)
Keyphrases
- graph coloring
- learning algorithm
- computational complexity
- dynamic programming
- combinatorial optimization
- cost function
- linear programming
- combinatorial problems
- genetic algorithm
- simulated annealing
- np hard
- objective function
- fitness function
- scheduling problem
- phase transition
- randomly generated
- bin packing
- hamiltonian cycle