Abstract
The Huffman tree is a binary tree storing each leaf with a key and its weight with the smallest weighted search time (i.e., the weighted sum of external path lengths).
The combinatorial structure of the Huffman tree depends on the weights of keys, and thus the space of weights is tessellated into regions called optimal regions associated with the combinatorial structures. In this paper we investigate properties of this tessellation.
We show that each optimal region is convex and non-empty. Moreover, we give a combinatorial necessary and sufficient condition for the adjacency of optimal regions. We also give analogous results for alphabetic trees.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Avis, D.: Living with lrs. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol. 1763, pp. 47–56. Springer, Heidelberg (2000)
Knuth, D.E.: The Art of Computer Programming, 3rd edn., vol. 1. Addison-Wesley, Reading (1997)
Knuth, D.E.: The Art of Computer Programming, 2nd edn., vol. 3. Addison-Wesley, Reading (1998)
Nagaraj, S.V.: Optimal binary search trees. Theoretical Computer Science 188, 1–44 (1997)
Onishi, K., Hoshi, M.: Generation of subdivision for binary search tree with optimal path length of search probability. IPSJ SIG-Notes Algorithms Abstract 76, 65–72 (2001) (in Japanese)
Ramanan, P.: Testing the optimality of alphabetic trees. Theoretical Computer Science 93, 279–301 (1992)
Sleator, D.D., Tarjan, R.E., Thurston, W.P.: Rotation distance, triangulations, and hyperbolic geometry. In: Proceedings of the eighteenth annual ACM symposium on Theory of computing, pp.122–135 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Onishi, K. (2004). Adjacency of Optimal Regions for Huffman Trees. In: Chwa, KY., Munro, J.I.J. (eds) Computing and Combinatorics. COCOON 2004. Lecture Notes in Computer Science, vol 3106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27798-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-27798-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22856-1
Online ISBN: 978-3-540-27798-9
eBook Packages: Springer Book Archive