The problem of minimum cost multicast tree satisfying bandwidth request and delay-constraint in communication network is a NP-complete problem. It is difficult to be solved by traditional methods.
通信网络时延受限且满足带宽要求的最小代价组播树问题是NP完全问题，传统方法难以求解，一般采用启发式方法求解。
The problem of minimum cost multicast tree satisfying bandwidth request and delay-constraint in communication network is a NP-complete problem. It is difficult to be solved by traditional methods.
通信网络时延受限且满足带宽要求的最小代价组播树问题是NP完全问题，传统方法难以求解，一般采用启发式方法求解。
应用推荐