Lin–Kernighan (Approximate TSP The Traveling-Salesman Problem)
Jump to navigation
Jump to search
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