Artificial Intelligence Algorithms Question:
Download Questions PDF

The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance what is the length of tour?

Answer:

The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is O(n!).

Download Artificial Intelligence Algorithms Interview Questions And Answers PDF

Previous QuestionNext Question
What is a heuristic function in artificial intelligence algorithms?When an algorithm A is admissible in artificial intelligence algorithms?