Show simple item record

dc.contributor.authorVeneziani, Pierangela
dc.date.accessioned2021-09-07T17:56:25Z
dc.date.available2021-09-07T17:56:25Z
dc.date.issued2/1/2008
dc.identifier.citationVeneziani, P. (2008). Graph-Based Upper Bounds for the Probability of the Union of Events. Electronic Journal of Combinatorics, 15(1R), 1-11.
dc.identifier.urihttp://hdl.handle.net/20.500.12648/2611
dc.descriptionFirst published in Electronic Journal of Combinatorics in 2008, published by the American Mathematical Society
dc.description.abstractWe 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.
dc.titleGraph-Based Upper Bounds for the Probability of the Union of Events
dc.typearticle
dc.source.journaltitleElectronic Journal of Combinatorics
dc.source.volume15
dc.source.issue1
refterms.dateFOA2021-09-07T17:56:26Z
dc.description.institutionSUNY Brockport
dc.source.peerreviewedTRUE
dc.source.statuspublished
dc.description.publicationtitleMathematics Faculty Publications
dc.contributor.organizationThe College at Brockport
dc.languate.isoen_US


Files in this item

Thumbnail
Name:
mth_facpub/8/fulltext (1).pdf
Size:
127.1Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record