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

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 con...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org
Hauptverfasser:	Guo, Heng, Jerrum, Mark
Format:	Paper
Sprache:	Englisch
Veröffentlicht:	Ithaca Cornell University Library, arXiv.org 10.02.2019
Schlagworte:	Algorithms Approximation Graph theory Logic programming Mathematical analysis Network reliability Polynomials Run time (computers) System reliability
ISSN:	2331-8422
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!