【摘要】 解决了网络流优化的快速数值逼近算法的稳定性问题,从而保证了用O(k(ε-2+lgk)lgn)个单个流的最小成本流的计算,来定性计算最大共存流的逼近解(其中:k是共存流数,n是节点数,而ε是精度要求)是优化的.更多还原

【Abstract】 It is shown a solution to the stability of the fast approximation for network flow optimization.By our method,the minimal cost flow computation can be ensured for O(k(ε^-2+lgk)lgn) separate flows.Consequently,approximate solution can be obtained for the maximum-concurrent flow and it can be ensured to be optimal.In our method,the related parameters can be roughly intepreted as follows:k means the number of concurrent commodies,n is the number of nodes,and ε is the desired precision.更多还原