4

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

Improve this question

1 Answer 1

Reset to default
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.

Improve this answer
Sign up to request clarification or add additional context in comments.

Comments

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.