Rosenkrantz; D. J.; Stearns; R. E.; Lewis; P. M. (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({1})$ words (Derived: Nearest neighbor search can be done with constant auxiliary space) == Description == Nearest neighbor search == Approximate? == Approximate Approximation Factor: 1/2\log n + 1/2 == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1974 == Reference == https://link.springer.com/chapter/10.1007/978-1-4020-9688-4_3")
Time Complexity
$O(V^{2})$
Space Complexity
$O({1})$ words
(Derived: Nearest neighbor search can be done with constant auxiliary space)
Description
Nearest neighbor search
Approximate?
Approximate
Approximation Factor: 1/2\log n + 1/2
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1974
Reference
https://link.springer.com/chapter/10.1007/978-1-4020-9688-4_3