Paper Info
Title
Combinatorial Merging and Huffman's Algorithm
Abstract
Huffman's algorithm produces an optimal weighted r-ary tree on a given set of leaf weights, where the weight of any parent node is the maximum of the son weights plus some positive constant. If the weights are viewed as (parallel) completion times, the algorithm has useful applications to combinatorial circuit designespecially for merging, or "fanning-in," a set of inputs with varying ready times: the weight of the tree's root node is then the completion time of the whole merging process. In this note we give new, tight upper and lower bounds on the weight of this root node (extending some work of Golumbic), and briefly describe an application in multiplexor design which exercises both of these bounds.
Year
DOI
Venue
1979
10.1109/TC.1979.1675367
IEEE Transactions on Computers
Keywords
DocType
Volume
leaf weight,ready time,optimal weighted r-ary tree,root node,multiplexor design,completion time,son weight,lower bound,parent node,combinatorial merging,circuit designespecially
Journal
28
Issue
ISSN
Citations 
5
0018-9340
5
PageRank 
References 
Authors
0.47
1
1
Name
Order
Citations
PageRank
Douglas Stott Parker Jr.19018.58