... Delay-Constrained Minimum Span- ning Tree Problem. In: Blum, C., Roli, A., Sampels, M. (eds.) Proceedings of the 2nd IEEE Symposium on Computers and Communications, pp. 699–703 (1997) 6. Ruthmair, M., Raidl, G.R.: A Kruskal-Based ...
... delay- constrained minimum spanning tree problem which produces faster and bet- ter results especially for tight delay - bounds and Euclidian edge - costs compared to the Prim - based approach . The runtime is almost independent of the ...
... problem . In : Handbook of Optimization in Telecommunications . ch . 19 , pp . 493–515 . Springer Science + Business Media , Hei- delberg ( 2006 ) 2. Ghaboosi , N. , Haghighat , A.T .: A Path Relinking Approach for Delay - Constrained Least ...
... path relinking approach for delay - constrained least - cost multicast routing problem . In : 19th IEEE International Conference on Tools with Artificial Intelligence , ICTAI 2007 , vol . 1 ... Multicast Routing Problem 139 References.
The evaluations show that DWH and DW-DPP construct multicast graphs with 10−15% lower costs than the node-priority based heuristics that are also explored in this work.
This book is designed for graduate students, researchers, and professionals interested in understanding the algorithmic and mathematical ideas behind routing in computer networks and network algorithms.