Problems in circuit fan-out reduction motivate the study of constructing various types of weighted trees that are optimal with respect to maximum weighted path length. An upper bound on the maximum weighted path length and an efficient construction algorithm will be presented for trees of degree at most $t$, along with their implications for circuit fan-out reduction.
© 1986 Society for Industrial and Applied Mathematics
Coppersmith, D., M. M. Klawe, and N. J. Pippenger. “Alphabetic Minimax Trees of Degree at Most t*.” SIAM Journal on Computing 15, no. 1 (February 1986): 189-192.