| Title: |
CALCULATING K-CONNECTEDNESS RELIABILITY USING STEINER BOUNDS. |
| Authors: |
Chari, Manoj K.; Provan, J. Scott |
| Source: |
Mathematics of Operations Research (INFORMS). Nov96, Vol. 21 Issue 4, p905. 17p. 1 Diagram, 2 Charts, 2 Graphs. |
| Subject Terms: |
*Probability theory; *Approximation theory; *Real property; K-theory; Reliability (Personality trait); Extension (Logic); Possession (Law) |
| Abstract: |
The K-connectedness reliability problem considered in this paper has as input undirected graph G, subset K of terminal vertices, and common edge failure probability p, and as output the probability R(G. K, p) that-when edges fail independently each with probability p-the set of operating edges connect every pair of vertices of K. We show how the Steiner property held by the underlying simplicial complex associated with this problem can lead to an extension of the Ball-Provan shellability bounds to this more general problem. We show in computational studies that this bound performs quite favorably in comparison with known approximation techniques. [ABSTRACT FROM AUTHOR] |
| : |
Copyright of Mathematics of Operations Research (INFORMS) is the property of INFORMS: Institute for Operations Research & the Management Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Business Source Premier |