Introduction to the Theory of Complexity and Approximation Algorithms.
Thomas JansenPublished in: Lectures on Proof Verification and Approximation Algorithms (1997)
Keyphrases
- approximation algorithms
- worst case
- np hardness
- np hard
- special case
- vertex cover
- minimum cost
- network design problem
- primal dual
- exact algorithms
- approximation ratio
- randomized algorithms
- computational complexity
- set cover
- approximation schemes
- open shop
- undirected graph
- precedence constraints
- facility location problem
- disjoint paths
- error bounds
- mathematical model
- upper bound