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
Giuseppe Di Fatta, Giuseppe Lo Re (1998). Efficient Tree Construction for the Multicast Problem. In ITS '98 Proceedings. (pp. 632-637). Piscataway : IEEE [10.1109/ITS.1998.718470].
Efficient Tree Construction for the Multicast Problem
Giuseppe Lo Re
1998-01-01
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
| File | Dimensione | Formato | |
|---|---|---|---|
|
Efficient tree construction for the multicast problem.pdf
Solo gestori archvio
Tipologia:
Versione Editoriale
Dimensione
689.42 kB
Formato
Adobe PDF
|
689.42 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
