Complexity of some graph-based bounds on the probability of a union of events
From MaRDI portal
Publication:1752603
DOI10.1016/j.dam.2018.03.012zbMath1387.05048OpenAlexW2794875535MaRDI QIDQ1752603
Fabio Tardella, Andrea Scozzari
Publication date: 24 May 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.012
Related Items (2)
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
Cites Work
- Unnamed Item
- Unnamed Item
- Computational algebraic algorithms for the reliability of generalized \(k\)-out-of-\(n\) and related systems
- Degree constrained node-connectivity problems
- On the SPANNING \(k\)-TREE problem
- Lower bounds for the probability of a union via chordal graphs
- The complexity of regular subgraph recognition
- On the complexity of some subgraph problems
- Upper bounds of degree 3 for the probability of the union of events via linear programming
- Hypertrees and Bonferroni inequalities
- Sharpened Bonferroni inequalities
- Minimum spanning hypertrees
- On spanning 2-trees in a graph
- Improved Bonferroni inequalities via abstract tubes. Inequalities and identities of inclusion-exclusion type
- On simple characterizations of k-trees
- Computing bounds for the probability of the union of events by different methods
- Upper bounds for the probability of a union by multitrees
- Probability Bounds with Cherry Trees
- Theory of Probability
- Iterative Methods in Combinatorial Optimization
- Bonferroni-Type Inequalities via Chordal Graphs
- New upper bounds on the probability of events based on graph structures
- NC algorithms for recognizing chordal graphs and k trees
- An improved Bonferroni inequality and applications
- An upper bound for the probability of a union
- Graph Classes: A Survey
- Probability bounds given by hypercherry trees
- Polynomially Computable Bounds for the Probability of the Union of Events
- Best Possible Inequalities for the Probability of a Logical Function of Events
- On acyclic simplicial complexes
This page was built for publication: Complexity of some graph-based bounds on the probability of a union of events
