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

Simple item page
dc.creatorKarger, David R.
dc.date1998-09-09
dc.date.accessioned2026-07-07T03:23:30Z
dc.date.available2026-07-07T03:23:30Z
dc.descriptionThe classic all-terminal network reliability problem posits a graph, each of whose edges fails independently with some given probability.
dc.descriptionTo appear in SICOMP
dc.identifierhttps://arxiv.org/abs/cs/9809012
dc.identifierhttp://arxiv.org/abs/cs/9809012
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32966
dc.subjectData Structures and Algorithms
dc.subjectF.2.2; G.2.2
dc.titleA Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem
dc.typetext

Files

Collections

arXiv