1) Min-VC
最小点覆盖问题
1.
The Parameterized Vertex Cover Problem (short as PVC or VC) and the Minimum Vertex Cover Problem (short as Min-VC) are two important NP-hard problems.
参数化点覆盖问题(the Parameterized Vertex Cover Problem，简称PVC或VC)和最小点覆盖问题(the Minimum Vertex Cover Problem，简称Min-VC)是重要的NP难问题，研究人员对其算法包括参数化点覆盖问题的核心化算法做了大量的研究。
2) minimal covering problem
最小顶点覆盖问题
1.
A DNA computing model and algorithm for the minimal covering problems by plasmids were presented.
给出了图的最小顶点覆盖问题的质粒DNA计算模型及其实现算法 。
2.
Closed circle DNA algorithm of the minimal covering problem is put forward.
提出了闭环DNA计算模型的基本概念及其基本生化实验,并给出了解决最小顶点覆盖问题的闭环DNA算法。
4) set-cover problem
最小集合覆盖问题
1.
Through the problem of lossy links inference is mapped to minimal set-cover problem,the algorithm based on heuristic strategy is proposed.
通过将失效链路推断问题映射为最小集合覆盖问题,提出了一种基于启发策略的失效链路推断算法。
6) vertex covering problem
顶点覆盖问题
1.
This paper presents the modeling process of the key covering problem(KCP) in the group rekeying and the transformations between the KCP and the vertex covering problem(VCP) in the graph theory.
本文给出了密钥覆盖问题模型的建立过程,首次给出密钥覆盖问题(KCP)与顶点覆盖问题(VCP)的相互变换。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条