... minimum vertex cover problem最小顶点涵盖问题 minimum set cover 最小集合覆盖 the minimum cover 限度的保险险别投保 ...
双语例句
1
The problem of seeking monitor-nodes for measuring the network traffic is regarded as the problem of finding out the minimum weak vertexcover of a graph which is NP-hard.