Virtual University of Pakistan Study forum !
Idea Solution:
If the TSP problem is solved by using a dynamic problem algorithm.There are at most O(n*2n) sub problems and each one takes linear time to solve. The total running time is, therefore, O(n2*2n. The time complexity is much less than O(n!) but still exponential. So although it is faster, it is still infeasible for any large n, and it has huge memory requirements for the table.
Tags:
Started by muhammad zubair in
General Discussion
13 hours ago.
0 Replies
1 Like
Started by muhammad zubair in
General Discussion
13 hours ago.
0 Replies
1 Like
Started by muhammad zubair in
General Discussion
Last reply by Eshaa 11 hours ago.
1 Reply
0 Likes
Started by muhammad zubair in
General Discussion
Last reply by Eshaa 11 hours ago.
1 Reply
0 Likes
Started by muhammad zubair in
General Discussion
14 hours ago.
0 Replies
1 Like
Started by muhammad zubair in
General Discussion
14 hours ago.
0 Replies
1 Like
Started by muhammad zubair in
General Discussion
15 hours ago.
0 Replies
1 Like
Started by muhammad zubair in
General Discussion
15 hours ago.
0 Replies
1 Like
Started by muhammad zubair in
General Discussion
15 hours ago.
0 Replies
1 Like
Started by muhammad zubair in
General Discussion
16 hours ago.
0 Replies
1 Like
© 2019 Created by Muhammad Anwar Tahseen.
Powered by
© Copyright Created by Muhammad Anwar Tahseen | Designed By VU HELP Team