【摘要】 首先建立了数据传输网络选择的最小成本模型,给出了有效支撑树代表集的概念,并给出了一个时间复杂性为 O(mlogen)的算法产生代表集。然后对静态数据传输问题和在线数据传输问题,分别给出了一个时间复杂性为 O(mlogen)和 O(m2+mlogen)的多项式时间的算法。更多还原

【Abstract】 First established the minimum transmission cost model in online multicast data transmission network, given the concept of efficient presenting set of spanning tree, and presented an algorithm to generate one efficient presenting set with time complexity O(mlogen). Then, the static multicast data transmission problem and online multicast data transmission problem are investigated, and two algorithms for them are presented , whose complexity are separately O(mlogen)and O(m2+mlogen).更多还原