2000 character limit reached
An FPRAS for two terminal reliability in directed acyclic graphs (2310.00938v3)
Published 2 Oct 2023 in cs.DS
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.
- #NFA admits an FPRAS: efficient enumeration, counting, and uniform generation for logspace classes. J. ACM, 68(6):48:1–48:40, 2021.
- A very hard log-space counting class. Theor. Comput. Sci., 107(1):3–30, 1993.
- Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests. In STOC, pages 408–420. ACM, 2021.
- Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid. In STOC, pages 1–12. ACM, 2019.
- Conjunctive queries on probabilistic graphs: the limits of approximability. arXiv, abs/2309.13287, 2023.
- Michael O. Ball. Complexity of network reliability computations. Networks, 10(2):153–165, 1980.
- Michael O. Ball. Computational complexity of network reliability analysis: An overview. IEEE Trans. Rel., 35(3):230–239, 1986.
- Calculating bounds on reachability and connectedness in stochastic networks. Networks, 13(2):253–278, 1983.
- Modified log-Sobolev inequalities for strongly log-concave distributions. Ann. Probab., 49(1):506–525, 2021.
- Near-linear time samplers for matroid independent sets with applications. arXiv, abs/2308.09683, 2023.
- Beyond the quadratic time barrier for network unreliability. arXiv, abs/2304.06552, 2023.
- Charles J. Colbourn. The Combinatorics of Network Reliability. Oxford University Press, 1987.
- The relative complexity of approximate counting problems. Algorithmica, 38(3):471–500, 2004.
- Tight bounds for popping algorithms. Random Struct. Algorithms, 57(2):371–392, 2020.
- A polynomial-time approximation algorithm for all-terminal network reliability. SIAM J. Comput., 48(3):964–978, 2019.
- A quasi-polynomial-time algorithm for sampling words from a context-free language. Inf. Comput., 134(1):59–74, 1997.
- Uniform sampling through the Lovász local lemma. J. ACM, 66(3):18:1–18:31, 2019.
- Improved bounds and algorithms for graph cuts and network reliability. Random Struct. Algorithms, 52(1):74–135, 2018.
- Mark Jerrum. On the complexity of evaluating multivariate polynomials. PhD thesis, The University of Edinburgh, 1981.
- Random generation of combinatorial structures from a uniform distribution. Theor. Comput. Sci., 43:169–188, 1986.
- David R. Karger. A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem. SIAM J. Comput., 29(2):492–514, 1999.
- David R. Karger. A phase transition and a quadratic time unbiased estimator for network reliability. In STOC, pages 485–495. ACM, 2020.
- Monte-Carlo algorithms for enumeration and reliability problems. In FOCS, pages 56–64. IEEE Computer Society, 1983.
- Monte-Carlo algorithms for the planar multiterminal network reliability problem. J. Complex., 1(1):45–64, 1985.
- Monte-Carlo approximation algorithms for enumeration problems. J. Algorithms, 10(3):429–448, 1989.
- A faster FPRAS for #NFA. arXiv, abs/2312.13320, 2023.
- The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput., 12(4):777–788, 1983.
- J. Scott Provan. The complexity of reliability computations in planar and acyclic graphs. SIAM J. Comput., 15(3):694–702, 1986.
- Leslie G. Valiant. The complexity of enumeration and reliability problems. SIAM J. Comput., 8(3):410–421, 1979.
- High-confidence estimation of small s-t reliabilities in directed acyclic networks. Networks, 57(4):376–388, 2011.