Re:Who Can Name the Bigger Number?
by xtacy on Thursday July 22, 2010 @09:19PM
(#1540093)
Using dynamic programming, you can solve the TSP problem in O(n^2 2^n) time with O(n 2^n) space, n = #cities.
[ Parent
| on HN ]
There are no comments on this comment yet.