| The best known solution methods for network reliability problems are of exponential time-complexity. This exponential behavior can render even moderately sized problems computationally intractable due to the enormous amount of time required to generate a solution. To render such problems solvable, an approximation algorithm has been developed that accurately estimates the source-to-terminal reliability of an arbitrary network. Linear time-complexity is a unique feature of this estimation algorithm, as is the fact that upper and lower bounds are also generated. |
