Efficient Tree Construction for the Multicast Problem

Giuseppe Lo Re, Giuseppe Lo Re, Giuseppe Di Di Fatta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

A new heuristic for the Steiner minimal tree problem is presented. 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 a stirring process of the nodes in solution trees. Classical heuristics and an enumerative method are used as comparison terms in the experimental analysis which demonstrates the capability of the heuristic discussed
Original languageEnglish
Title of host publicationITS '98 Proceedings.
Pages632-637
Number of pages6
Publication statusPublished - 1998

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Signal Processing

Cite this

Lo Re, G., Lo Re, G., & Di Fatta, G. D. (1998). Efficient Tree Construction for the Multicast Problem. In ITS '98 Proceedings. (pp. 632-637)