An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion.
Mikko KoivistoPublished in: FOCS (2006)
Keyphrases
- graph coloring
- benchmark problems
- dynamic programming
- learning algorithm
- combinatorial optimization
- combinatorial problems
- computational complexity
- np complete problems
- test problems
- particle swarm optimization
- np complete
- optimization algorithm
- memetic algorithm
- difficult problems
- distributed breakout
- hamiltonian cycle
- min max
- max sat
- phase transition
- traveling salesman problem
- constraint satisfaction