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 条

[1] A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem
Karger, DR
SIAM REVIEW, 2001, 43 (03) : 499 - 522
[2] A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem
Karger, DR
SIAM JOURNAL ON COMPUTING, 1999, 29 (02) : 492 - 514
[3] Simulation of all-terminal reliability of an undirected network using the reliability polynomial
Paripovic, Aleksandar
Obradovic, Predrag
Protic, Jelica
2020 28TH TELECOMMUNICATIONS FORUM (TELFOR), 2020, : 367 - 370
[4] All-Terminal Network Reliability Using Recursive Truncation Algorithm
Sharafat, Ahmad R.
Ma'rouzi, Omid R.
IEEE TRANSACTIONS ON RELIABILITY, 2009, 58 (02) : 338 - 347
[5] Implementing a fully polynomial time approximation scheme for all terminal network reliability
Karger, DR
Tai, RP
PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 334 - 343
[6] COMBINING VERTEX DECOMPOSITIONS WITH FACTORING IN AN ALL-TERMINAL NETWORK RELIABILITY ALGORITHM
PAGE, LB
PERRY, JE
MICROELECTRONICS AND RELIABILITY, 1990, 30 (02): : 249 - 263
[7] An Algorithm to Compute the All-terminal Reliability Measure
Héctor Cancela
Gerardo Rubino
María E. Urquhart
OPSEARCH, 2001, 38 (6) : 567 - 579
[8] An Algorithm for Computing All-terminal Reliability Bounds
Silva, Jaime
Gomes, Teresa
Tipper, David
Martins, Lucia
Kounev, Velin
2014 6TH INTERNATIONAL WORKSHOP ON RELIABLE NETWORKS DESIGN AND MODELING (RNDM), 2014, : 76 - 83
[9] Estimating all-terminal network reliability using a neural network
Srivaree-ratana, C
Smith, AE
1998 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5, 1998, : 4734 - 4739
[10] Chip firing and all-terminal network reliability bounds
Brown, Jason I.
Colbourn, Charles J.
Nowakowski, Richard J.
DISCRETE OPTIMIZATION, 2009, 6 (04) : 436 - 445

← 1 2 3 4 5 →