On optimal routing trees

The authors consider the problem of transforming a routing matrix to an optimal routing tree where the cost of a tree is the sum of the link costs. A routing tree is called alphabetical if the partition at each internal node is always into components of consecutive categories. The authors give a cubic algorithm for the optimal alphabetical routing tree problem. They also solve the optimal routing tree problem for some other special cases.<
>