On the complexity of distributed graph coloring with local minimality constraints.
Cyril GavoilleRalf KlasingAdrian KosowskiLukasz KusznerAlfredo NavarraPublished in: Networks (2009)
Keyphrases
- graph coloring
- distributed constraint optimization problems
- combinatorial problems
- job shop scheduling
- constraint programming
- distributed sensor networks
- constraint satisfaction problems
- distributed breakout
- constraint satisfaction
- phase transition
- combinatorial optimization
- sat encodings
- max sat
- scheduling problem
- distributed constraint satisfaction
- distributed systems
- decision problems
- distributed environment
- computational complexity
- job shop scheduling problem
- resource constraints
- hyper heuristics
- global constraints
- constraint propagation