1.7.5 Text Compression

Problem Input | Problem Output 


INPUT                    OUTPUT

Input Description: A text string S .

Problem: A shortest text string S' such that S can be reconstructed from S' .

Implementations

  • Netlib / TOMS -- Collected Algorithms of the ACM (FORTRAN) (rating 5)

    Related Problems

  • Cryptography
  • Discrete Fourier Transform
  • Shortest Common Superstring

    Go to the corresponding chapter in the book
    About the Book
    Send us Mail
    Go to Main Page

    This page last modified on Tue Jun 03, 1997 .