A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem (Q2753004): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:24, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem |
scientific article |
Statements
A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem (English)
0 references
23 October 2001
0 references
network reliability
0 references
approximation scheme
0 references
minimum cut
0 references
