Probabilistically checkable proofs and their consequences for approximation algorithms.
Stefan HougardyHans Jürgen PrömelAngelika StegerPublished in: Discret. Math. (1994)
Keyphrases
- approximation algorithms
- special case
- np hard
- minimum cost
- worst case
- facility location problem
- vertex cover
- stochastic logic programs
- constant factor
- exact algorithms
- network design problem
- open shop
- np hardness
- randomized algorithms
- primal dual
- set cover
- approximation ratio
- undirected graph
- polynomial time approximation
- genetic algorithm
- approximation guarantees
- approximation schemes
- precedence constraints
- linear programming
- search space
- optimal solution
- disjoint paths
- learning algorithm