Approximation algorithms for grammar-based compression.
Eric LehmanAbhi ShelatPublished in: SODA (2002)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- network design problem
- image compression
- minimum cost
- facility location problem
- open shop
- np hardness
- primal dual
- exact algorithms
- approximation schemes
- constant factor
- randomized algorithms
- undirected graph
- set cover
- approximation ratio
- precedence constraints
- disjoint paths