1.

Which of the following problems were reduced to Knapsack?

A. Exact Cover
B. Max Cut
C. 0-1 integer programming
D. None of the mentioned
Answer» B. Max Cut


Discussion

No Comment Found