着重证明了K -树组法为多项式时间复杂性算法。
It is proved that K-Tree Term method is a multinomial time complexity algorithm.
对某些特殊类型的分配问题，给出了多项式复杂性的分配算法。
Polynomial time algorithms are given for some special types of connected assignment.
并且对这两类问题都研究了他们的计算复杂性并给出了最优算法或者多项式时间近似算法。
For both problems, we study their computational complexity and present optimal algorithms or polynomial time approximation algorithms.
应用推荐