| Article ID: | iaor20022477 |
| Country: | United States |
| Volume: | 34 |
| Issue: | 2 |
| Start Page Number: | 122 |
| End Page Number: | 131 |
| Publication Date: | Sep 1999 |
| Journal: | Networks |
| Authors: | Anazawa Tsutomu, Kodera Takayuki, Jimbo Masakazu |
| Keywords: | programming: integer |
In this paper, an explicit solution of the optimum requirement spanning tree, 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.