Optimality conditions for Hunter’s bound |
| |
| Authors: | Pierangela Veneziani |
| |
| Affiliation: | Department of Mathematics, SUNY College at Brockport, 350 New Campus Drive, Brockport, NY 14420, USA |
| |
| Abstract: | ![]()
The bound known as Hunter’s bound states that  , where T designates the heaviest spanning tree of the graph on n nodes with edge weights pi,j. We prove that Hunter’s bound is optimal if and only if the input probabilities are given on a tree. |
| |
| Keywords: | Hunter&rsquo s bound Probability bounds Probability of the union |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
