Held–Karp algorithm (Minimum TSP The Traveling-Salesman Problem)
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == Reference == https://www.jstor.org/stable/2098806")
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