网络流量监测点问题可以抽象为图的最小弱顶点覆盖问题，而求解最小弱顶点覆盖问题是一个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

并针对点的重复覆盖问题对每次迭代的结果进行了启发式改进，消除了冗余的子集。

Also aimed at duplicated covering of a point, this paper proposes a heuristic improvement of the result of each iteration, which removed the redundancy sub-collection.

youdao

并针对点的重复覆盖问题对每次迭代的结果进行了启发式改进，消除了冗余的子集。

Also aimed at duplicated covering of a point, this paper proposes a heuristic improvement of the result of each iteration, which removed the redundancy sub-collection.

youdao