The fractional greedy algorithm for data compression

DOI10.1007/BF02238290zbMath0842.94007MaRDI QIDQ1906680

Ulrich Pferschy, Gerhard J. Woeginger, József Békési, Gábor Galambos

Publication date: 5 August 1996

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

data compressionshortest pathsheuristic encoding

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Information theory (general) (94A15) Source coding (94A29)

Related Items (1)

Worst-case analysis of the iterated longest fragment algorithm

Cites Work

• Unnamed Item
• Parallel algorithms for data compression
• A universal algorithm for sequential data compression
• An analysis of the longest match and the greedy heuristics in text encoding
• Greedy Algorithms for On-Line Data Compression

This page was built for publication: The fractional greedy algorithm for data compression