Christofides algorithm (Approximate TSP The Traveling-Salesman Problem)
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{3})$ == Space Complexity == $O(V^{2})$??? words (Depends on best space complexity for O(V^3) min-weight matching (the rest of the algorithm requires O(V) auxiliary space)) == Description == == Approximate? == Approximate Approximation Factor: 1.5 == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1976 == Reference == https://apps.dtic.mil/dtic/tr/fulltext/u2/a025602.pdf")
Time Complexity
$O(V^{3})$
Space Complexity
$O(V^{2})$??? words
(Depends on best space complexity for O(V^3) min-weight matching (the rest of the algorithm requires O(V) auxiliary space))
Description
Approximate?
Approximate
Approximation Factor: 1.5
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1976