A Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem

TL;DR

This paper introduces a fully polynomial randomized approximation scheme for efficiently estimating the probability that a network remains connected despite random edge failures, improving computational feasibility.

Contribution

It presents a novel approximation algorithm that significantly enhances the efficiency of estimating all-terminal network reliability.

Findings

Provides a polynomial-time approximation scheme for the problem

Achieves high accuracy with probabilistic guarantees

Reduces computational complexity compared to previous methods

Abstract

The classic all-terminal network reliability problem posits a graph, each of whose edges fails independently with some given probability.