Random searching multicast tree generating heuristic
Li Han · Journal of China Institute of Communications · 2000
We modify the method of subpath adding to the existed subtree for MPH Thus we get RSH With the random graph mode,the simulation shows that RSH can compute faster with relatively smaller cost increasing Comparing with other MST,RSH is much faster