Optimum Requirement Spanning Trees and Reliability of Tree Networks

In this paper, an explicit solution of the optimum requirement spanning tree (ORST), studied by Hu, is obtained in the case when a weight is assigned to each node and when maximum-degree conditions are given. Further, the solution is shown to minimize the probability of communication failure in the situation where one node or line is broken down. © 1999 John Wiley & Sons, Inc. Networks 34: 122-131, 1999