In this paper, we give a new algorithm for the bottleneck assignment problem on the basis of Konig's theorem, and show that the time complexity of the algorithm is O(n3).
参考文献
相似文献
引证文献
引用本文
晓斌,张干宗.瓶颈指派问题的一种多项式时间算法[J].国防科技大学学报,1997,19(1):94-98. Xiao Bin, Zhang Ganzong. A Polynomial-time Algorithm for the Bottleneck Assignment Problem[J]. Journal of National University of Defense Technology,1997,19(1):94-98.