Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems.
Oriana PontaFalk HüffnerRolf NiedermeierPublished in: TAMC (2008)
Keyphrases
- dynamic programming
- np hard
- np complete
- computationally challenging
- np hardness
- optimization problems
- linear programming
- genetic algorithm
- decision problems
- constraint satisfaction problems
- maximum independent set
- min sum
- np hard problems
- infinite horizon
- graph representation
- graph model
- graph theory
- scheduling problem
- special case
- lower bound
- computational complexity
- optimal solution