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

Authors

  • 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.

Downloads

Download data is not yet available.

Downloads

Published

2015-06-17

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

Issue

Vol. 14 No. 1 (1999)

Section

Regular Papers

License

Authors who publish in this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CC BY-NC 4.0 (Attribution-NonCommercial 4.0 International) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  2. Authors can enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) before and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).

___________

Received 2015-06-17
Accepted 2015-06-17
Published 2015-06-17