Example: Find vertex cover of size k in time 2kn many algorithms only feasible for very small k More ﬁne-grained than P and NP missing in almost every library We have many resouces for you if you are interested in this topic (e.g., Parameterized Algorithms by Cygan et al.) Minimum vertex cover is one of the Karp‘s 21 diverse combinatorial and graph theoretical problems (Karp, 1972), which were proved to be NP-complete. Minimum vertex cover is a special case of the set cover problem (Thomas H. Cormen & Stein, 2001) which takes as input an arbitrary collection of subsets S = (S 1, S 2, .., S n) of the

Stack Exchange network consists of 176 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.