An FPRAS for two terminal reliability in directed acyclic graphs
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- October 2023
- DOI:
- 10.48550/arXiv.2310.00938
- arXiv:
- arXiv:2310.00938
- Bibcode:
- 2023arXiv231000938F
- Keywords:
-
- Computer Science - Data Structures and Algorithms
- E-Print:
- 30 pages. v3: improved presentation