论文信息 - A New Proof of the Garsia-Wachs Algorithm

A New Proof of the Garsia-Wachs Algorithm

Abstract A new proof of correctness for the Garsia-Wachs algorithm is presented. Like the well-known Hu-Tucker algorithm, the Garsia-Wachs algorithm constructs minimum cost binary trees in O ( n log n ) time. The new proof has a simpler structure and is free of the difficult inductions of the original.

Jeffrey H. Kingston

[1] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[2] T. C. Hu. A New Proof of the T-C Algorithm , 1973 .

[3] T. C. Hu,et al. Optimal Computer Search Trees and Variable-Length Alphabetical Codes , 1971 .

[4] E. F. Moore,et al. Variable-length binary encodings , 1959 .

[5] Adriano M. Garsia,et al. A New Algorithm for Minimum Cost Binary Trees , 1977, SIAM J. Comput..