Tagged Questions
0
votes
0answers
150 views
Complexity of TSP using Dynamic Programming [closed]
I was reading about TSP using Dynamic Programming and the complexity was given as
$\theta (n^2 2^n)$
Certain intermediate calculations are given as
$N= \Sigma_{k=0}^{n-2}(n-1)C(n-2,k) = ...
