A Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem
<|reference_start|>A Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem: The classic all-terminal network reliability problem posits a graph, each of whose edges fails independently with some given probability.<|reference_end|>
@article{karger1998a,
    title={A Fully Polynomial Randomized Approximation Scheme for the All Terminal
  Network Reliability Problem},
    author={David R. Karger},
    journal={arXiv preprint arXiv:cs/9809012},
    year={1998},
    archivePrefix={arXiv},
    eprint={cs/9809012},
    primaryClass={cs.DS}
}