A Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem

Details A Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem A Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem

1998-09-09

arxiv.org/abs/cs/9809012v1

Computer Science

Data Structures and Algorithms

To appear in SICOMP

Scientific paper

The classic all-terminal network reliability problem posits a graph, each of
whose edges fails independently with some given probability.

Affiliated with

Also associated with

No associations

Rating

A Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-487837