2 research outputs found
An FPRAS for two terminal reliability in directed acyclic graphs
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.Comment: 30 pages. v3: improved presentatio