arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.08561cs.DS
收藏

全终端网络可靠度的多项式时间近似算法

A polynomial-time approximation algorithm for all-terminal network reliability

Heng Guo, Mark Jerrum

摘要:

本文给出了全终端网络可靠性问题的一个完全多项式时间随机近似方案(FPRAS),即在无向图中,假设每条边独立失效,其余图仍然连通的概率.我们的主要贡献是证实了Gorobacky和Pak(Random Struct. Algorithms,2014)的一个猜想,即双向图中“集群弹出”算法的预期运行时间受输入大小的多项式限制。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑