Held–Karp algorithm (Minimum TSP The Traveling-Salesman Problem)
Jump to navigation
Jump to search
Time Complexity
$O(V^{2} {2}^V)$
Space Complexity
$O(V*{2}^V)$ words
(Need to store all C(S, l) for all subsets $S \subseteq V$ and all vertices l)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1962