Barvinok (Geometric Maximum 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.

28 April 2023

15 February 2023

  • curprev 10:3410:34, 15 February 2023‎ Admin talk contribs‎ 412 bytes +412‎ Created page with "== Time Complexity == $O(V^{2} loglogE)$ == Space Complexity == $O(V)$? memory cells (Derived: One memory cell per tunnel-city pair, with one tunnel total) == Description == Tunneling == Approximate? == Approximate Approximation Factor: ? == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 2003 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/876638.876640"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Barvinok_(Geometric_Maximum_TSP_The_Traveling-Salesman_Problem)"