A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR ALL-TERMINAL NETWORK RELIABILITY

被引：19
|
作者：
Guo, Heng [1 ]
Jerrum, Mark [2 ]
机构：
[1] Univ Edinburgh, Sch Informat, Edinburgh EH8 9AB, Midlothian, Scotland
[2] Queen Mary Univ London, Sch Math Sci, London E1 4NS, England
来源：
SIAM JOURNAL ON COMPUTING | 2019年 / 48卷 / 03期
基金：
英国工程与自然科学研究理事会;
关键词：
network reliability; approximate counting; randomized algorithms; COMPUTATIONAL-COMPLEXITY;
D O I：
10.1137/18M1201846
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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 an undirected graph, assuming each edge fails independently, the remainder of the graph is still connected. Our main contribution is to confirm a conjecture by Gorodezky and Pak [Random Structures Algorithms, 44 (2014), pp. 201-223] that the expected running time of the "cluster-popping" algorithm in bidirected graphs is bounded by a polynomial in the size of the input.
引用
收藏
页码：964 / 978
页数：15
相关论文
共 50 条
  • [31] All-terminal network reliability optimization via probabilistic solution discovery
    Ramirez-Marquez, Jose Emmanuel
    Rocco, Claudio M.
    RELIABILITY ENGINEERING & SYSTEM SAFETY, 2008, 93 (11) : 1689 - 1697
  • [32] Structure of Polynomial-Time Approximation
    van Leeuwen, Erik Jan
    van Leeuwen, Jan
    THEORY OF COMPUTING SYSTEMS, 2012, 50 (04) : 641 - 674
  • [33] The complexity of polynomial-time approximation
    Cai, Liming
    Fellows, Michael
    Juedes, David
    Rosamond, Frances
    THEORY OF COMPUTING SYSTEMS, 2007, 41 (03) : 459 - 477
  • [34] Structure of Polynomial-Time Approximation
    Erik Jan van Leeuwen
    Jan van Leeuwen
    Theory of Computing Systems, 2012, 50 : 641 - 674
  • [35] The Complexity of Polynomial-Time Approximation
    Liming Cai
    Michael Fellows
    David Juedes
    Frances Rosamond
    Theory of Computing Systems, 2007, 41 : 459 - 477
  • [36] Research on the genetic algorithm-based all-terminal network optimization
    Zou, G. Z.
    Huang, X. L.
    Manufacturing and Engineering Technology, 2015, : 377 - 380
  • [37] A polynomial-time approximation algorithm for joint probabilistic data association
    Oh, S
    Sastry, S
    ACC: Proceedings of the 2005 American Control Conference, Vols 1-7, 2005, : 1283 - 1288
  • [38] A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR DYNAMIC STORAGE-ALLOCATION
    KIERSTEAD, HA
    DISCRETE MATHEMATICS, 1991, 88 (2-3) : 231 - 237
  • [39] A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
    Jerrum, M
    Sinclair, A
    Vigoda, E
    JOURNAL OF THE ACM, 2004, 51 (04) : 671 - 697
  • [40] Optimal polynomial-time estimators: A bayesian notion of approximation algorithm
    Kosoy, Vanessa
    Appel, Alexander
    Journal of Applied Logics, 2020, 7 (04): : 561 - 675
12345