演算法›Ch5 NP Complete Problems第 17 題／共 30 題
17. Vertex Cover、Complexity Classes、Approximation
#AL-05-017易Vertex CoverComplexity ClassesApproximation
- Assume . The VERTEX-COVER problem is to find a vertex cover of minimum size in a given undirected graph. Choose all and only those complexity classes that are known to contain the corresponding VERTEX-COVER decision problem.
📄 交大111
▤完整推導請見《WH 資工筆記 · 演算法》Ch5 NP Complete Problems