4

Does there exist a polynomial time algorithm for Travelling Salesman Problem on complete directed graph?

Unknown
  • 53
  • 1
  • 5

1 Answers1

3

Unlikely. If there was one you could take any graph and add all the missing edges with a very high weight. That would allow solving the standard version of the problem, which is known to be NP-hard.

wrwrwr
  • 1,008
  • 2
  • 11
  • 19