Research output per year
Research output per year
Abstract
We give a fully polynomial-time randomized approximation scheme (FPRAS) for the all-terminal network reliability problem, which is to determine the probability that, in a undirected graph, assuming each edge fails independently, the remaining graph is still connected. Our main contribution is to confirm a conjecture by Gorodezky and Pak (Random Struct. Algorithms, 2014), that the expected running time of the “cluster-popping” algorithm in bi-directed graphs is bounded by a polynomial in the size of the input.
| Original language | English |
|---|---|
| Pages (from-to) | 964–978 |
| Number of pages | 15 |
| Journal | SIAM Journal on Computing |
| Volume | 48 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 9 May 2019 |
Fingerprint
Dive into the research topics of 'A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability'. Together they form a unique fingerprint.Research output
- 1 Conference contribution
-
A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
Guo, H. & Jerrum, M., 9 Jul 2018, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Chatzigiannakis, I., Kaklamanis, C., Marx, D. & Sannella, D. (eds.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, Vol. 107. p. 68:1-68:12 12 p. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 107).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile
Profiles
-
Heng Guo
- School of Informatics - Reader in Algorithms and Complexity
- Laboratory for Foundations of Computer Science - Lecturer in Algorithms and Complexity
- Foundations of Computation
Person: Academic: Research Active (Teaching)