Greedy Algorithms for On-Line Data Compression

DOI10.1006/JAGM.1997.0885zbMATH Open0895.68062OpenAlexW2141819328MaRDI QIDQ4373003FDOQ4373003

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

Publication date: 8 September 1998

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1997.0885

Recommendations

• scientific article; zbMATH DE number 764405
• The fractional greedy algorithm for data compression
• An analysis of the longest match and the greedy heuristics in text encoding
• scientific article

zbMATH Keywords

differential greedy algorithmlongest matching algorithmtext-compression problems

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Cited In (5)

• Worst-case analysis of the iterated longest fragment algorithm
• The fractional greedy algorithm for data compression
• An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results
• Compror: On-line lossless data compression with a factor oracle.
• Title not available (Why is that?)

This page was built for publication: Greedy Algorithms for On-Line Data Compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373003)