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 条

[41] OPTIMAL POLYNOMIAL-TIME ESTIMATORS: A BAYESIAN NOTION OF APPROXIMATION ALGORITHM
Kosoy, Vanessa
Appel, Alexander
JOURNAL OF APPLIED LOGICS-IFCOLOG JOURNAL OF LOGICS AND THEIR APPLICATIONS, 2020, 7 (04): : 561 - 675
[42] ON THE COMPUTATIONAL BEHAVIOR OF A POLYNOMIAL-TIME NETWORK FLOW ALGORITHM
BLAND, RG
JENSEN, DL
MATHEMATICAL PROGRAMMING, 1992, 54 (01) : 1 - 39
[43] A POLYNOMIAL-TIME ALGORITHM FOR FINDING THE ABSOLUTE CENTER OF A NETWORK
MINIEKA, E
NETWORKS, 1981, 11 (04) : 351 - 355
[44] A polynomial-time algorithm for computing K-terminal residual reliability of d-trapezoid graphs
Lin, Min-Sheng
Ting, Chao-Chun
INFORMATION PROCESSING LETTERS, 2015, 115 (02) : 371 - 376
[45] BOUNDS FOR ALL-TERMINAL RELIABILITY BY ARC-PACKING
RAMANATHAN, A
COLBOURN, CJ
ARS COMBINATORIA, 1987, 23A : 229 - 236
[46] An approximation polynomial-time algorithm for a sequence bi-clustering problem
A. V. Kel’manov
S. A. Khamidullin
Computational Mathematics and Mathematical Physics, 2015, 55 : 1068 - 1076
[47] An approximation polynomial-time algorithm for a sequence bi-clustering problem
Kel'manov, A. V.
Khamidullin, S. A.
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2015, 55 (06) : 1068 - 1076
[48] All-Terminal Network Reliability Optimization in Fading Environment via Cross Entropy Method
Kharbash, Shawqi
Wang, Wenye
2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS - ICC 2010, 2010,
[49] BOUNDING ALL-TERMINAL RELIABILITY IN COMPUTER-NETWORKS
COLBOURN, CJ
HARMS, DD
NETWORKS, 1988, 18 (01) : 1 - 12
[50] Polynomial-time approximation schemes for the Euclidean survivable network design problem
Czumaj, A
Lingas, A
Zhao, HR
AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 973 - 984

← 1 2 3 4 5 →