The fractional greedy algorithm for data compression

Computing (Vienna/New York)

Volumn 56, Issue 1, 1996, Pages 29-46

  Bekesi J ^a,b   Galambos, G ^a,b   Pferschy, U ^a,c   Woeginger, G J ^a,c  

^a Department of Computer Science ^*

^b JGYTF   (Hungary)

^c GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Optimal and heuristic encoding; Shortest paths; Textual substitution

Indexed keywords

DATA COMPRESSION; ENCODING (SYMBOLS); HEURISTIC METHODS; ONLINE SYSTEMS;

CODE WORDS; FRACTIONAL GREEDY ALGORITHMS; HEURISTIC ENCODING; OPTIMAL ENCODING; SHORTER CODE SEQUENCE; SHORTEST PATHS; TEXTUAL SUBSTITUTION;

ALGORITHMS;

EID: 0029733480     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02238290     Document Type: Article

References (5)

1. Békési J., Galambos G., Pferschy U., Woeginger G. J.: Greedy algorithms for on-line data compression. Report 276-93, Mathematical Institute, TU Graz, Austria 1993.
2. Gonzalez-Smith, M. E., Storer, J. A.: Parallel algorithms for data compression. J. ACM 32, 344-373 (1985).
3. Katajainen, J., Raita, T.: An analysis of the longest matching and the greedy heuristic in text encoding. J. ACM 39, 281-294 (1992).
4. Schuegraf, E. J., Heaps, H. S.: A comparison of algorithms for data base compression by use of fragments as language elements. Inf. Stor. Ret. 10, 309-319 (1974).
5. Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23, 337-343 (1977).