In computer and information science, there exists the important problem of finding a binary tree wit h the minimum weighted path length for a given set of weights. In this problem, the binary tree's leaves are uniquely labeled with positive real weights w 1,..., w,-,(n> 2) in some order, and the weighted path lengt h of the tree is given by E 1 wi th, where d1 is the depth of the leaf labeled with wi. This paper presents a simple, straightforward derivation of a lower bound on the weighted path length. This problem has a long history. Huffman [2] gave an ...
Vitit Kantabutra hasn't uploaded this paper.
Let Vitit know you want this paper to be uploaded.
