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.
网络流量监测点问题可以抽象为图的最小弱顶点覆盖问题，而求解最小弱顶点覆盖问题是一个NP难题。
In this paper, Minimum Exact Cover Problem (MECP) for key distribution is presented, and a heuristic solution is testified.
本文提出组密钥分发的最小准确覆盖问题，并证明一种启发式的解。
应用推荐