From arXiv

The hypergraph unreliability problem asks for the probability that a hypergraph gets disconnected when every hyperedge fails independently with a given probability. For graphs, the unreliability problem has been studied over many decades, and multiple fully polynomial-time approximation schemes are known starting with the work of Karger (STOC 1995). In contrast, prior to this work, no non-trivial result was known for hypergraphs (of arbitrary rank). In this paper, we give quasi-polynomial time approximation schemes for the hypergraph unreliability problem. For any fixed \(\varepsilon \in (0, 1)\), we first give a \((1+\varepsilon)\)-approximation algorithm that runs in \(m^{O(\log n)}\) time on an \(m\)-hyperedge, \(n\)-vertex hypergraph. Then, we improve the running time to \(m\cdot n^{O(\log^2 n)}\) with an additional exponentially small additive term in the approximation.

Simplify

Published on March 27, 2024

Copy BibTeX

Loading...

Comments

There is no AI-powered summary yet, because we do not have a budget to generate summaries for all articles.

1. Buy subscription

We will thank you for helping thousands of people to save their time at the top of the generated summary.

If you buy our subscription, you will be able to summarize multiple articles.

See an example

Pay $undefined

≈10 summaries

Pay $undefined

≈60 summaries

2. Share on socials

If this article gets to top-5 in trends, we'll summarize it for free.

Copy link