Large-scale Knowledge Processing: Lecture 11
2026.1.09 (Fri) 4th period
Today's Lecture： Approaches to solve NP-complete problems (2)
- 2-Approximation Algorithm for Minimum Vertex Cover (MVC)
- Exact Algorithm and FPT Algorithm for NP-complte Problems
- FPT Algorithms for Vertex Cover (VC)
Materials
Slides
2026.1.08 Constructed. Lecturer：Kazuhisa Seto
seto @ ist.hokudai.ac.jp