Observer wrote:My Pascal solution, having complexity of T*C^2, runs in 0.6 sec.
Search found 2 matches
- Mon Aug 30, 2004 5:44 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10702 - Travelling Salesman
- Replies: 20
- Views: 13201
- Mon Aug 30, 2004 4:40 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10702 - Travelling Salesman
- Replies: 20
- Views: 13201
10702 - Travelling Salesman
I use DP to solve this problem. The complexity of my algo is lg(T)*C^3
my program take about 2 second to run all the test case.
How to make the time less than 1 second?
any better algo?
my program take about 2 second to run all the test case.
How to make the time less than 1 second?
any better algo?