| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9657197 | Journal of Discrete Algorithms | 2005 | 15 Pages |
Abstract
A linear-time approximation algorithm for the grammar-based compression is presented. This is an optimization problem to minimize the size of a context-free grammar deriving a given string. For each string of length n, the algorithm guarantees O(logngâ) approximation ratio without suffix tree construction.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Hiroshi Sakamoto,