Deterministic Approximation Algorithms for the Nearest Codeword Problem.
Noga AlonRina PanigrahySergey YekhaninPublished in: APPROX-RANDOM (2009)
Keyphrases
- approximation algorithms
- randomized algorithms
- np hard
- special case
- vector quantization
- approximation guarantees
- minimum cost
- vertex cover
- worst case
- facility location problem
- primal dual
- exact algorithms
- set cover
- np hardness
- approximation ratio
- network design problem
- constant factor
- open shop
- hamming distance
- undirected graph
- image compression