๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An explicit expression for the cost of a class of Huffman trees

โœ Scribed by F.K. Hwang

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
180 KB
Volume
32
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

A Huffman tree H, is a Gary tree wh:ch minimizes C(T, 1 W) over all possible T,,. In this note, we give an explicit expression for C(H" I W) when W assumes the form: w, = k for i=l,..., n-m; w,=xfori=n-m+l,..., n. This simplifies and generalizes earlier results in the literature.

๐Ÿ“œ SIMILAR VOLUMES

On a condition for obtaining an explicit
On a condition for obtaining an explicit solution of optimum requirement spanning tree
โœ Anazawa, Tsutomu ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 70 KB ๐Ÿ‘ 1 views

The optimum requirement spanning tree (ORST) studied by Hu is known to be obtained by the Gomory-Hu algorithm when the degrees of vertices are not restricted. We consider a problem to find an ORST with maximum-degree constraints and suggest a particular spanning tree T\* as a candidate for the solut