进一步分析了求解基于最大流划分的最小弱顶点覆盖集的近似算法。

Finally the approximation algorithm for the minimum weak vertex cover set is analyzed based on the maximal flow partition.

youdao

网络流量监测点问题可以抽象为图的最小弱顶点覆盖问题，而求解最小弱顶点覆盖问题是一个NP难题。

The problem of seeking monitor-nodes for measuring the network traffic is regarded as the problem of finding out the minimum weak vertex cover of a graph which is NP-hard.

youdao