Greedy Algorithms for On-Line Data Compression

Journal of Algorithms

Volumn 25, Issue 2, 1997, Pages 274-289

  Békési, József ^a   Galambos, Gábor ^a   Pferschy, Ulrich ^b   Woeginger, Gerhard J ^c  

^a JGYTF   (Hungary)

^b UNIVERSITY OF GRAZ   (Austria)

^c GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004748624     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0885     Document Type: Article

References (5)

1. J. Békési, G. Galambos, U. Pferschy, and G. J. Woeginger, The fractional greedy algorithm for data compression, Computing 56 (1996), 29-46.
2. M. E. Gonzalez-Smith and J. A. Storer, Parallel algorithms for data compression, J. Assoc. Comput. Mach. 32 (1985), 344-373.
3. J. Katajainen and T. Raita, An analysis of the longest matching and the greedy heuristic in text encoding, J. Assoc. Comput. Mach. 39 (1992), 281-294.
4. E. J. Schuegraf and H. S. Heaps, A comparison of algorithms for data base compression by use of fragments as language elements, Inform. Stor. Ret. 10 (1974), 309-319.
5. J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Trans. Inform. Theory 23 (1977), 337-343.