Evaluating the behavior of successive approximation algorithms under soft errors.
Gennaro Severino RodriguesFernanda Lima KastensmidtPublished in: LATS (2017)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- network design problem
- worst case
- facility location problem
- minimum cost
- primal dual
- open shop
- precedence constraints
- exact algorithms
- randomized algorithms
- set cover
- constant factor
- approximation schemes
- constraint satisfaction problems
- objective function
- approximation ratio