Lin–Kernighan (Approximate TSP The Traveling-Salesman Problem)
Revision as of 11:39, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{2})$ == Space Complexity == $O(V)$ words (https://doi.org/10.1016/S0377-2217(99)00284-2) == Description == Heuristic == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1981 == Reference == https://www.cs.princeton.edu/~bwk/btl.mirror/tsp.pdf")
Time Complexity
$O(V^{2})$
Space Complexity
$O(V)$ words
(https://doi.org/10.1016/S0377-2217(99)00284-2)
Description
Heuristic
Approximate?
Approximate
Approximation Factor:
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1981