| 作成者 |
|
|
|
|
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
In the grammar-based compression scheme, a given text string is transformed into a context-free grammar $ G $ such that $ L(G)={ omega } $ and then encoded in an appropriate manner. The compression i...s thus regarded as an optimization ploblem of minimizing the size of $ G $ for a given string $ omega $ of length $ n $. For the APX-hard problem an $ O(log n) $ approximation algorithm with arbitrary string is presented. The previously known best approximation ratio was $ O(sqrt{n/log n}) $[8]続きを見る
|
Mendeley出力
trcs201.ps
trcs201