论文部分内容阅读
文章利用拉格朗日松驰因子将成本函数加入到时延目标函数中,从而使时延受限最小成本组播问题简化为求最小成本组播树问题。通过修正拉格朗日松驰因子,最终得到一棵满足时延限制的最小成本组播树。
The article uses the Lagrange slack factor to add the cost function to the delay objective function, so that the minimum cost multicast with delay limitation is reduced to the minimum cost multicast tree problem. By modifying the Lagrange relaxation factor, we finally get a minimum cost multicast tree that satisfies the delay constraints.