Artificial Economy as a Vehicle for Designing Approximation Algorithms for NP-Complete Problems.
Fouad B. ChedidPublished in: IS (2002)
Keyphrases
- approximation algorithms
- np complete problems
- np complete
- np hard
- graph coloring
- phase transition
- special case
- worst case
- vertex cover
- hard problems
- randomized algorithms
- set cover
- decision problems
- constant factor
- constraint satisfaction problems
- approximation ratio
- genetic algorithm
- optimal solution
- satisfiability problem
- polynomial time approximation
- disjoint paths
- sat problem
- combinatorial problems
- linear programming
- scheduling problem
- computational complexity
- undirected graph
- randomly generated
- optimization algorithm
- multi objective
- constant factor approximation