Efficient tree construction for the multicast problemDi Fatta, G. and Lo Re, G. (1998) Efficient tree construction for the multicast problem. In: ITS'98 proceedings : SBT/IEEE International Telecommunications Symposium : Maksoud Plaza Hotel, São Paulo, Brazil, August 9-13, 1998. IEEE, Piscataway, N.J., pp. 632-637. ISBN 9780780350304 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. To link to this item DOI: 10.1109/ITS.1998.718470 Abstract/SummaryA 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 a stirring process of the nodes in solution trees. Classical heuristics and an enumerative method are used CIS comparison terms in the experimental analysis which demonstrates the goodness of the heuristic discussed in this paper.
Altmetric Related URLs Deposit Details References University Staff: Request a correction | Centaur Editors: Update this record |
Lists
Lists
