The measure station selection problem can be mapped to vertex cover problem . By make use of the traffic flow conservation law could deduce the problem into weak vertex cover problem and thus further reduce the measure station deployments .

其中测量站点的选取问题可映射为 顶点 覆盖 问题，通过对流量规律利用，可将问题归约为弱顶点覆盖问题，从而一步减少测量站点的部署。

This paper presents a new Hybrid Genetic Algorithm ( HGA ) to solve minimum vertex cover problem . Combining SGA and Local Optimization Technique ( LOT ) this improves local searching ability of SGA and gives near to optimal solution speedy .

提出了一种新的求解最小 顶点 覆盖 问题的混合遗传算法，将基本遗传算法与局部优化策略相结合，改善遗传算法的局部搜索能力，加快求解该问题的速度。

A DNA Algorithm Based on Satisfiable Solution Space & for the Minimum Vertex Cover Problem

基于可满足解空间的DNA算法&解决最小 顶点 覆盖 问题

A semidefinite relaxation is attained from the equivalence form for the Vertex Cover Problem in a normal way .

对 顶点 覆盖 问题的一种等价模型，利用一般的松弛方法，得到了一个半定规划松弛模型。

Next an approximation algorithm for the minimum weak vertex cover set problem is constructed and the approximation ratio of 2 by primal-dual method is analyzed . Finally the approximation algorithm for the minimum weak vertex cover set is analyzed based on the maximal flow partition .

然后利用原始对偶方法构造了 求解最小弱 顶点 覆盖集的近似算法，并分析了算法的比界为2.进一步分析了求解基于最大流划分的最小弱顶点覆盖集的近似算法。

This paper mainly focuses on the following two subjects : the encoding problem and DNA computing algorithm for the minimum vertex cover problem .

本文的研究主要 包括二方面的内容： DNA计算中的编码问题和DNA计算实例 模型 研究。

DNA algorithm for minimum vertex cover problem based on molecular computation

最小 顶点 覆盖 问题的DNA分子算法

The algorithm is a significant improvement over the previous algorithms for the minimum fault coverage problem for reconfigurable arrays with its running time bounded by O ( 1 . 26k + kn ) as well as over the related parameterized algorithms for the minimum vertex cover problem .

这是关于可重构阵列的最小瑕点覆盖问题算法又一较大的改进，也是目前最小 点 覆盖 问题相关参数算法的较有意义的改进。

Measure station deployment problem can be mapped to the minimum vertex cover problem . When determining the deployment station we need to take a reasonable measure assignment to make the measurement cost is relatively low .

测量站点的部署问题可映射为 最小 覆盖 问题，当确定部署站点后，则需求取合理的测量分配，使得测量代价相对较低。

Combined with the secure communications problem of wireless sensor networks s-path vertex cover problem is proposed .

加之受无线传感网络安全通信问题的启发，人们提出了s-路径 顶点 覆盖这一 问题。