Login / Signup
A Better Performance Guarantee for Approximate Graph Coloring.
Bonnie Berger
John Rompel
Published in:
Algorithmica (1990)
Keyphrases
</>
graph coloring
combinatorial problems
job shop scheduling
np complete problems
phase transition
constraint satisfaction problems
hamiltonian cycle
scheduling problem
hyper heuristics
max sat
metaheuristic
constraint satisfaction
np hard
combinatorial optimization