Rosenkrantz; D. J.; Stearns; R. E.; Lewis; P. M. (Approximate TSP The Traveling-Salesman Problem): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:3911:39, 15 February 2023‎ Admin talk contribs‎ 449 bytes +449‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Rosenkrantz;_D._J.;_Stearns;_R._E.;_Lewis;_P._M._(Approximate_TSP_The_Traveling-Salesman_Problem)"