An FPRAS for two terminal reliability in directed acyclic graphs
Data Structures and Algorithms
2024-02-16 v3
Abstract
We give a fully polynomial-time randomized approximation scheme (FPRAS) for two terminal reliability in directed acyclic graphs (DAGs). In contrast, we also show the complementing problem of approximating two terminal unreliability in DAGs is #BIS-hard.
Cite
@article{arxiv.2310.00938,
title = {An FPRAS for two terminal reliability in directed acyclic graphs},
author = {Weiming Feng and Heng Guo},
journal= {arXiv preprint arXiv:2310.00938},
year = {2024}
}
Comments
30 pages. v3: improved presentation