Complexity of approximation algorithms for combinatorial problems: a survey.
George GensEugene LevnerPublished in: SIGACT News (1980)
Keyphrases
- approximation algorithms
- combinatorial problems
- worst case
- np hard
- np hardness
- constraint programming
- exact algorithms
- constraint satisfaction problems
- metaheuristic
- graph coloring
- constraint satisfaction
- branch and bound algorithm
- combinatorial optimization
- special case
- phase transition
- vertex cover
- traveling salesman problem
- solving hard
- minimum cost
- combinatorial search
- global constraints
- open shop
- approximation ratio
- constant factor
- lower bound
- computational complexity
- primal dual
- space complexity
- upper bound
- np complete
- disjoint paths
- precedence constraints
- polynomial time approximation
- neural network
- constant factor approximation