Lin–Kernighan (Approximate TSP The Traveling-Salesman Problem)

From Algorithm Wiki
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.ezproxy.canberra.edu.au/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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(V^{2})$

Space Complexity

$O(V)$ words

(https://doi-org.ezproxy.canberra.edu.au/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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Lin–Kernighan_(Approximate_TSP_The_Traveling-Salesman_Problem)&oldid=44687"