A randomized fully polynomial time approximation scheme for the all terminal network reliability problem

David R. Karger. A randomized fully polynomial time approximation scheme for the all terminal network reliability problem. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA. pages 11-17, ACM, 1995. [doi]

Abstract

Abstract is missing.