t
traveling salesman problem
ConceptMentioned in 1 video
An example of an NP problem where finding the shortest route to visit multiple cities is difficult, but verifying a given route's length is easy.
An example of an NP problem where finding the shortest route to visit multiple cities is difficult, but verifying a given route's length is easy.
