Exact and approximation algorithms for error-detecting even codes.
Paulo Eustáquio Duarte PintoFábio ProttiJayme Luiz SzwarcfiterPublished in: Theor. Comput. Sci. (2012)
Keyphrases
- approximation algorithms
- np hard
- special case
- facility location problem
- vertex cover
- worst case
- set cover
- error detection
- network design problem
- error bounds
- minimum cost
- open shop
- constant factor
- randomized algorithms
- np hardness
- error correction
- approximation schemes
- constant factor approximation
- precedence constraints
- disjoint paths
- primal dual
- undirected graph
- approximation ratio
- exact algorithms
- objective function
- active learning