Vertex Cover

hybrid genetic algorithm for vertex cover problem

一种求解顶点覆盖问题的混合遗传算法

first the problem was modeled as an instance of vertex cover problem which was an np -complete problem.

先把该问题归结为图的顶点覆盖问题，它是一个NP完全问题；

improved greedy-edge approximation algorithm of the optimal vertex-cover

改进的最优顶点覆盖贪心边近似算法

an approximation algorithm based on chain implication for constrained minimum vertex cover in bipartite graphs

一种基于链暗示技术的二分图受约束最小点覆盖问题的近似算法

an exact algorithm to improve the upper bound of vertex cover and independent set problem for low degree graphs is presented.

给出了一种提高低度图点覆盖和独立集问题下界的精确算法。

greedy-edge approximation algorithm with the optimal vertex-cover

最优顶点覆盖的贪心边近似算法

a monitoring model for link bandwidth usage of network based on weak vertex cover

基于弱顶点覆盖的网络链路使用带宽监测模型

an efficient algorithm for constraint bipartite vertex cover

二分图约束的顶点覆盖问题的快速算法

improvement on vertex cover and independent set problem for low-degree graphs

低度图的点覆盖和独立集问题下界改进

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.

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

dna algorithm for minimum vertex cover problem based on molecular computation

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