A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
A Space-Saving Approximation Algorithm for Grammar-Based Compression
2009
IEICE transactions on information and systems
Hiroshi SAKAMOTO †a) , Member, Shirou MARUYAMA † †b) , Takuya KIDA † † †c) , and Shinichi SHIMOZONO †d) , Nonmembers SUMMARY A space-efficient approximation algorithm for the grammar-based compression problem, which requests for a given string to find a smallest context-free grammar deriving the string, is presented. For the input length n and an optimum CFG size g, the algorithm consumes only O(g log g) space and O(n log * n) time to achieve O((log * n) log n) approximation ratio to the
doi:10.1587/transinf.e92.d.158
fatcat:aj43d6v2zvb2pbganpte7dpfzi