Polynomial approximation algorithms with performance guarantees: An introduction-by-example.
Marc DemangeVangelis Th. PaschosPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- constant factor
- approximation algorithms
- approximation guarantees
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- approximation schemes
- set cover
- np hardness
- facility location problem
- network design problem
- exact algorithms
- precedence constraints
- primal dual
- randomized algorithms
- polynomial time approximation
- open shop
- approximation ratio
- undirected graph
- simulated annealing
- low degree