Greedy Algorithms for On-Line Data Compr
✍
József Békési; Gábor Galambos; Ulrich Pferschy; Gerhard J Woeginger
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 191 KB
We consider on-line text-compression problems where compression is done by Ž . substituting substrings according to some fixed static dictionary code book . Due to the long running time of optimal algorithms, several heuristics have been introduced in the literature. In this paper, we continue the i