Which one of the following is not NP-Hard problem?
2021
Which one of the following is not NP-Hard problem?
Answer: A. Assignment problem — The Assignment problem is solvable in polynomial time using the Hungarian Algorithm → therefore it is NOT NP-Hard. Other problems listed (TSP, Non-linear…
- A.
Assignment problem
- B.
Travelling salesman problem
- C.
Non-linear programming
- D.
Hamiltonian cycle problem
Attempted by 299 students.
Show answer & explanation
Correct answer: A
The Assignment problem is solvable in polynomial time using the Hungarian Algorithm → therefore it is NOT NP-Hard. Other problems listed (TSP, Non-linear programming, Hamiltonian cycle) are NP-Hard.
Loading lesson…