Skip to main content
SpringerLink
Log in

Greedy Algorithms for On-Line Data Compression

  • Conference paper
Operations Research Proceedings 1994

Part of the book series: Operations Research Proceedings ((ORP,volume 1994))

  • 174 Accesses

Summary

Text-compression problems are considered where substrings are substituted by code-words according to a static dictionary such that the original text is encoded by a shorter code sequence.

We complete the worst-case analysis of an earlier studied on-line heuristic and introduce a new efficient algorithm which maximizes the local compaction ratio.

Upper bounds are derived for the compaction ratio between on-line heuristics and the optimal encoding for different types of dictionaries.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Békési, G. Galambos, U. Pferschy and G.J. Woeginger, Greedy algorithms for on-line data compression, Report 276-93, Mathematical Institute, TU Graz, Austria 1993.

    Google Scholar 

  2. J. Bekesi, G. Galambos, U. Pferschy and G.J. Woeginger, The fractional greedy algorithm for data compression, Report 292-94, Mathematical Institute, TU Graz, Austria 1994.

    Google Scholar 

  3. J. Katajainen and T. Raita, An analysis of the longest matching and the greedy heuristic in text encoding, Journal of the ACM 39, 1992, 281–294.

    Article  Google Scholar 

  4. E.J. Schuegraf and H.S. Heaps, A comparison of algorithms for data base compression by use of fragments as language elements, Inf. Stor. Ret. 10, 1974, 309–319.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Szeged, Hungary

    József Békési & Gábor Galambos

  2. Graz, Austria

    Ulrich Pferschy & Gerhard J. Woeginger

Authors
  1. József Békési
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gábor Galambos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ulrich Pferschy
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gerhard J. Woeginger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Wirtschaftsinformatik und Operations Research, Universität zu Köln, Pohligstraße 1, D-50969, Köln, Germany

    Ulrich Derigs (Lehrstuhl) (Lehrstuhl)

  2. Mathematisches Institut, Universität zu Köln, Weyertal 80, D-50931, Köln, Germany

    Achim Bachem

  3. Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel, Olshausenstraße 40, D-24118, Kiel, Germany

    Andreas Drexl

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Békési, J., Galambos, G., Pferschy, U., Woeginger, G.J. (1995). Greedy Algorithms for On-Line Data Compression. In: Derigs, U., Bachem, A., Drexl, A. (eds) Operations Research Proceedings 1994. Operations Research Proceedings, vol 1994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79459-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-79459-9_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58793-4

  • Online ISBN: 978-3-642-79459-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation