An efficient algorithm for constructing delay bounded minimum cost multicast trees

DOI10.1016/J.JPDC.2004.08.007zbMath1073.68526OpenAlexW2138216287MaRDI QIDQ705564

Taieb Znati, Shu Li, R. G. Melhem

Publication date: 31 January 2005

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2004.08.007

zbMATH Keywords

Constrained minimizationDijkstra's algorithmBounded delaysDiscrete delaysLow-cost multicastingMulticast trees

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed systems (68M14)

Related Items (1)

Solving the quorumcast routing problem by constraint programming

This page was built for publication: An efficient algorithm for constructing delay bounded minimum cost multicast trees