一类推广的Bottleneck问题的多项式算法

A Polynomial Algorithm for a Kind of Extended Bottleneck Problem

本文讨论了一类Bottleneck问题,给出了判定最优解的三个定理,并在此基础上给出了一个求最优解的算法和算例,算法的复杂度为O(n2).

A kind of extended bottleneck problem is discussed.Three theorems about the optimal solution to the problem are given.According to them,an algorithm and a computation to seek the optimal solution are presented with the algorithmic complexity set at O（n2）.