A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability

Heng Guo, Mark Jerrum

Research output: Contribution to journalArticlepeer-review

Abstract

We give a fully polynomial-time randomized approximation scheme (FPRAS) for the all-terminal network reliability problem, which is to determine the probability that, in a undirected graph, assuming each edge fails independently, the remaining graph is still connected. Our main contribution is to confirm a conjecture by Gorodezky and Pak (Random Struct. Algorithms, 2014), that the expected running time of the “cluster-popping” algorithm in bi-directed graphs is bounded by a polynomial in the size of the input.
Original languageEnglish
Pages (from-to)964–978
Number of pages15
JournalSIAM Journal on Computing
Volume48
Issue number3
DOIs
Publication statusPublished - 9 May 2019

Fingerprint

Dive into the research topics of 'A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability'. Together they form a unique fingerprint.

Cite this