Computational Complexity of Approximation Algorithms for Combinatorial Problems.
George GensEugene LevnerPublished in: MFCS (1979)
Keyphrases
- approximation algorithms
- combinatorial problems
- np hard
- computational complexity
- constraint satisfaction problems
- special case
- branch and bound algorithm
- constraint programming
- np complete
- worst case
- graph coloring
- metaheuristic
- combinatorial optimization
- phase transition
- constraint satisfaction
- traveling salesman problem
- solving hard
- exact algorithms
- vertex cover
- scheduling problem
- minimum cost
- approximation ratio
- lower bound
- randomized algorithms
- linear programming
- graph colouring
- optimal solution
- decision problems
- open shop
- primal dual
- set cover
- upper bound
- randomly generated
- global constraints
- constraint propagation
- precedence constraints
- combinatorial search
- disjoint paths
- integer programming
- combinatorial auctions
- linear program
- cellular automata
- ant colony optimization
- tabu search