Which of the following problems do not belong to Karp’s 21 NP-complete problems?
(a) Vertex Cover problems
(b) Knapsack
(c) 0-1 integer programming
(d) None of the mentioned
This question was addressed to me at a job interview.
Query is from Node-Cover Problem, Hamilton Circuit Problem topic in chapter Intractable Problems of Automata Theory