vertex cover problem 中文意思是什麼
vertex cover problem
解釋
頂點覆蓋問題-
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還對如何修復給出了兩個演算法:一個是近似演算法,到目前為止,該演算法仍然是最高效的頂點覆蓋問題的求解演算法之一。 -
Che [ 1 ] proposed a heuristic fault spectrum algorithm that solves the cbvc problem very efficient but still not guarantee the minimization of the set of vertex cover
Che在此前也曾提出過一種基於啟發式的錯誤譜演算法[ 1 ] ,有效提高了求解的效率。但該演算法仍然存在不能保證最優解的問題。
分享友人