In this paper we study such a special case: a tree network with all sources on a path and we present its polynomial-time algorithms.
本文研究了这样的特殊情形:树网络上所有起点处于同一条路上,建立了多项式时间算法。
An integer programming formulation for channel assignment problem with channel loading is presented and polynomial time algorithms are designed for some special radio networks in this paper.
给出了具有频道负荷约束的专用移动无线电网络问题的整数线性规划,设计了求解特殊网络的具有频道负荷约束的频道分配问题的多项式时间算法。
Polynomial time algorithms are given for some special types of connected assignment.
对某些特殊类型的分配问题,给出了多项式复杂性的分配算法。
应用推荐