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.

arXiv comment30 pages. v3: improved presentation