which one is more time complexity between TSP or CPP?

168 Views Asked by At

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 ?

1

There are 1 best solutions below

0
On

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.