An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs

Published: 01 Jan 2024, Last Modified: 17 May 2025ICALP 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
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.
Loading