Greedy compression systems

  • M. Loebl
Part III Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 464)


The concept of compressions of trees encompasses many foundamental problems of computer science. We define a greedy strategy consisting in performing compressions from end-vertices of maximum distance to the root.

We use a lexicorgaphic coding to obtain a lower bound for maximum total length of greedy compression systems in form n. α(n), where α(n) is the functional inverse to the Ackermann function. This bound is optimal for balanced trees.

We also discuss other strategies with better bounds.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. /1/.
    Aho, A.V., Hopcroft, J.E., Ullman, J.D. (1974): The design and analysis of computer algoritms. Addison-Wesley, ReadingGoogle Scholar
  2. /2/.
    Galler, B.A., Fischer, M.J.(1964): An improved equivalence algorithm. Commun. ACM 7, 301–303CrossRefGoogle Scholar
  3. /3/.
    Hart, S., Sharir, M. (1986): Non-linearity of Davenport-Schinzel sequences and of generalized path compression schemes. Combinatorica 6, 151–177 (see also Proc. 24th IEEE FOCS (1985), pp. 313–319)Google Scholar
  4. /4/.
    Hopcroft, J.E., Ullman, J.D. (1973): Set merging algorithms. SIAM J. Comput. 2, 294–303Google Scholar
  5. /5/.
    Loebl, M., Matoušek, J. (1987): Hercules versus Hidden Hydra Helper. KAM-series (submitted)Google Scholar
  6. /6/.
    Loebl, M., Nešetřil, J. (1988): Linearity and unprovability of the Set Union Problem Strategies (an extended abstract). Proceedings STOC ConferenceGoogle Scholar
  7. /7/.
    Loebl, M., Nešetřil, J. (1989): Unprovability of Set Union Problem Strategies. Report No. 88528-OR, Institut für Operations Research, BonnGoogle Scholar
  8. /8/.
    Loebl, M., Nešetřil, J. (1989(: Linearity and unprovability of set union problem strategies: I. Linearity of on-line postorder. Technical Report 89–04, University of Chicago (Submitted for publication)Google Scholar
  9. /9/.
    Tarjan, R.E. (1975): Efficiently of a good but not linear set union algorithm. J. Assoc. Comput. Mach. 22, 215–225Google Scholar
  10. /10/.
    Loebl, M. (1990): Partial Postorder, manuscriptGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • M. Loebl
    • 1
  1. 1.Department of Applied MathematicsFaculty of Mathematics and Physics Charles UniversityPragueCzechoslovakia

Personalised recommendations