What's the difference between traveling-salesman problem and Chinese postman problem From a Time complexity perspective? I mean which one is more time complexity between TSP and CPP ?
Asked
Active
Viewed 125 times
0
-
You're probably asking for a complexity of a solution not a problem and it depends on which solution will you choose. – Yoda Nov 28 '19 at 13:54
-
Can you explain more? – Mohammad Reza Nov 28 '19 at 14:01
-
In general, I want to know which of the following is more time complex? – Mohammad Reza Nov 28 '19 at 14:04
1 Answers
0
Chinese postman problem can be solved in polynomial time (https://en.wikipedia.org/wiki/Route_inspection_problem), TSP is NP complete (https://en.wikipedia.org/wiki/Travelling_salesman_problem).
So unless P=NP, the travelling salesman problem has a higher time complexity.
Daniel Junglas
- 5,830
- 1
- 5
- 22