Research Article
On the Location of a Constrained Tree Facility in a Tree Network with Unreliable Edges
Algorithm 1
| Inputs: A tree with an operational probability associated with each edge and two positive integers | |
| Outputs: A reliable tree core with diameter of at most and having exactly leaves which | |
| maximizes the reliability sum . | |
| Initialization: and | |
| begin | |
| For each do | |
| Orient the input tree into a rooted tree . | |
| For each do | |
| If is a leaf then | |
| Else | |
| End If | |
| End For | |
| For do | |
| For each do | |
| If is a leaf then | |
| Else | |
| where | |
| End If | |
| End For | |
| End For | |
| Sort in a decreasing order all the entries in according to their reliability savings | |
| If the top entries are contained in one subtree of then | |
| Replace the entry by the second reliability saving path passing through | |
| Else | |
| Choose the top entries of and construct the induced subtree | |
| End If | |
| Calculate the reliability sum of | |
| , where | |
| End For | |
| End |