Accessibility navigation

Efficient tree construction for the multicast problem

Di Fatta, G. and Lo Re, G. (1999) Efficient tree construction for the multicast problem. Journal of the Brazilian Telecommunications : Revista da Sociedade Brasileira de Telecomunicações, 14 (1). pp. 22-29. ISSN 0102-986X

Full text not archived in this repository.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

Official URL:


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

Item Type:Article
Divisions:No Reading authors. Back catalogue items
Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
ID Code:6140
Additional Information:See also Journal of Communication and Information Systems 14 no.1 pp. 22-29

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation