顶点覆盖问题 meaning in English

vertex cover problem

In this thesis , a polynomial function of exact cover to area minimization was given , and one case , k 3 , is discussed
本论文利用最小顶点覆盖问题规约到面积优化问题,只需讨论k 3一种情况,证明过程很简略。
But the classical vertex cover algorithm can not use in the cbvc problem directly , because the cbvc problem have more term need to constraint
但是，以上的算法并不能直接应用于受二分图约束的顶点覆盖问题( constraintbipartitevertexcover , cbvc )求解。
This problem was first studied by n . hasan and c . l . liu in [ 5 ] , and get some useable result : this problem can be solved as a constraint bipartite vertex cover ( cbvc ) problem . hasan and liu proposed two algorithms that solves the cbvc problem
另外， kuo和fuchs还对如何修复给出了两个算法：一个是近似算法，到目前为止，该算法仍然是最高效的顶点覆盖问题的求解算法之一。