|
|
|
|
|
|
by Dylan16807
3861 days ago
|
|
|
The Traveling Salesman Decision Problem, the one that's NP-complete and not just NP-hard, does not ask for the lowest cost route. It asks whether there is a route cheaper than k. Verifying that is trivial, you just follow the route and compare to k. |
|
|