A Fully Polynomial Randomized Approximation Scheme for Hypergraph Unreliability
cs.DS
Submitted: 2026-10-30
Updated: 2026-10-30
Comments: 19 pages
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Hypergraph Unreliability in Quasi-Polynomial Time
- Network Unreliability in Almost-Linear Time
- Approximating two-terminal network reliability
Related papers
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles