Locally Searching Minimum Path Cost Heuristic
Li Han · Dianzi xuebao · 2000
On the basis of MPH (Minimum Path Cost Heuristic),The method of subpath adding to the partially constructed multicast tree is modified.Thus two algorithms are adopted,one is locally searching minimum path cost heuristic (LSMPH) and the other is shortest terminal minimum path cost heuristic (STMPH),the simplified version of LSMPH.With the random graph model,the simulation shows that LSMPH can compute faster with relatively smaller cost increasing.If much shorter computing time is needed,STMPH is more suitable than LSMPH.