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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Data Structures and Algorithms, F.2.2; G.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/32966

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/9809012
 http://arxiv.org/abs/cs/9809012

Collections

arXiv