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

@article{Karger1998AFP,
  title={A Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem},
  author={David R. Karger},
  journal={CoRR},
  year={1998},
  volume={cs.DS/9809012}
}
The classic all-terminal network reliability problem posits a graph, each of whose edges fails independently with some given probability. The goal is to determine the probability that the network becomes disconnected due to edge failures. This problem has obvious applications in the design of communication networks. Since the problem is ♯P-complete, and thus believed hard to solve exactly, a great deal of research has been devoted to estimating the failure probability. In this paper, we give a… CONTINUE READING