go-v.orgdoi

Graph-Based Upper Bounds for the Probability of the Union of Events

Pierangela Veneziani · The Electronic Journal of Combinatorics · 2008

  • DOI 10.37236/752
  • Publisher Electronic Journal of Combinatorics
  • Type article
  • Issued 2008

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2008

Abstract

We consider the problem of generating upper bounds for the probability of the union of events when the individual probabilities of the events as well as the probabilities of pairs of these events are known. By formulating the problem as a Linear Program, we can obtain bounds as objective function values corresponding to dual basic feasible solutions. The new upper bounds are based on underlying bipartite and threshold type graph structures.

Open the resolved locator · 10.37236/752

Metadata licence: OpenAlex metadata (CC0)