Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
In this paper we consider a special kind of binary trees where each right edge is associated with a positive number α and each left edge with a positive number β(α ≦ β). Given α, β and the number of nodes n, an optimal tree is one which minimizes the total weighted path length. An algorithm for constructing an optimal tree for given α, β, n is presented, based on which bounds for balances and total weighted path lengths of optimal trees are derived. © 1977 BIT Foundations.
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
T. Graham, A. Afzali, et al.
Microlithography 2000
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering