A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
From MaRDI portal
Publication:2753004
DOI10.1137/S0036144501387141zbMath0972.05045MaRDI QIDQ2753004
Publication date: 23 October 2001
Published in: SIAM Review (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25) Graph algorithms (graph-theoretic aspects) (05C85) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items (8)
Polynomial-time algorithms for multimarginal optimal transport problems with structure ⋮ Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms ⋮ Unnamed Item ⋮ Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width ⋮ Practical Minimum Cut Algorithms ⋮ Inapproximability of the Tutte polynomial ⋮ Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width ⋮ Not all FPRASs are equal: demystifying FPRASs for DNF-counting
This page was built for publication: A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
