🎴 Flashcard Mode
Combinatorial Optimization: NP-Completeness and Approximation Algorithms
Card1 / 15
Mastered0
Review0
QuestionClick to flip
Which of the following problems is NP-complete?
AnswerClick to flip back
A
Traveling Salesman Problem
💡 Explanation:
The Traveling Salesman Problem is a classic NP-complete problem, where a salesman must find the shortest route to visit a set of cities and return to the starting city.