Bonferroni-Type Inequalities via Chordal Graphs
From MaRDI portal
Publication:3146983
Recommendations
- Lower bounds for the probability of a union via chordal graphs
- scientific article; zbMATH DE number 1222377
- scientific article; zbMATH DE number 176901
- Inclusion-exclusion-Bonferroni identities and inequalities for discrete tube-like problems via Euler characteristics
- Bonferroni-type inequalities; Chebyshev-type inequalities for the distributions on \([0, n]\)
Cited in
(4)- Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs
- Polynomially computable bounds for the probability of the union of events
- Upper bounds of degree 3 for the probability of the union of events via linear programming
- Complexity of some graph-based bounds on the probability of a union of events
This page was built for publication: Bonferroni-Type Inequalities via Chordal Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3146983)