Bonferroni-Type Inequalities via Chordal Graphs
From MaRDI portal
Publication:3146983
DOI10.1017/S0963548302005151zbMath1001.60022OpenAlexW2067141170MaRDI QIDQ3146983
Publication date: 15 December 2002
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548302005151
Related Items (4)
Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs ⋮ Complexity of some graph-based bounds on the probability of a union of events ⋮ Upper bounds of degree 3 for the probability of the union of events via linear programming ⋮ Polynomially Computable Bounds for the Probability of the Union of Events
This page was built for publication: Bonferroni-Type Inequalities via Chordal Graphs