搜索结果: 1-2 共查到“理学 vertex cover”相关记录2条 . 查询时间(0.156 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：A 1.344-approximation algorithm for the vertex cover problem
顶点覆盖问题 1.344 近似算法
font style='font-size:12px;'>
2023/12/11
We present an algorithm for the vertex cover problem by combining the LP relaxation and the random edge-reductions. The algorithm has the expected approximation ratio of 1.344.
Minimum k-path vertex cover
Minimum k-path vertex cover
font style='font-size:12px;'>
2011/1/20
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by k(G)the minimum cardinality of a k-path vertex cover i...