.png){kind=icon}
返回
Bottleneck multicast trees in linear time
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2003.820102.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
On a directed graph with arc costs and a given source node s, we consider the problem of computing multicast (Steiner) trees spanning any given node subset V, so that the maximum of the tree arc costs is minimized. We show that this problem can be solved by simply solving the bottleneck path problem, i.e., the problem of determining for each node t not equal s a path from s to t so that the maximum of path arc costs is minimized. For the latter problem we provide an implementation of Dijkstra's algorithm that runs in linear time under mild assumptions on are costs.
Keyword:
bottleneck path
bottleneck multicast tree
min-max Steiner tree
multicasting
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏 没有更多内容
没有更多内容