Deterministic Approximation Algorithms for the Nearest Codeword Problem.
Noga AlonRina PanigrahySergey YekhaninPublished in: Electron. Colloquium Comput. Complex. (2008)
Keyphrases
- approximation algorithms
- randomized algorithms
- np hard
- special case
- worst case
- vector quantization
- vertex cover
- approximation guarantees
- facility location problem
- minimum cost
- network design problem
- approximation ratio
- approximation schemes
- hamming distance
- np hardness
- polynomial time approximation
- constant factor
- open shop
- exact algorithms
- primal dual
- precedence constraints
- undirected graph
- combinatorial auctions
- error bounds
- image compression