Efficient Tree Construction for the Multicast Problem<br />10.14209/jcis.1999.4

Main Article Content

Giuseppe Di Fatta
Giuseppe Lo Re

Abstract

A new heuristic for the Steiner Minimal Tree problem is presented here. The method described is based on the detection of particular sets of nodes in networks, the "Hot Spot" sets, which are used to obtain better approximations of the optimal solutions. An algorithm is also proposed which is capable of improving the solutions obtained by classical heuristics, by means of node rearrangements in the solution tree. Classical heuristics and an enumerative method are used as comparison terms in the experimental analysis which demonstrates the goodness of the heuristics discussed in this paper.

Article Details

How to Cite
Di Fatta, G., & Lo Re, G. (2015). Efficient Tree Construction for the Multicast Problem<br />10.14209/jcis.1999.4. Journal of Communication and Information Systems, 14(1). Retrieved from https://jcis.sbrt.org.br/jcis/article/view/228
Section
Regular Papers