Barvinok (Geometric Maximum TSP The Traveling-Salesman Problem): Difference between revisions
Jump to navigation
Jump to search
(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/doi/10.1145/876638.876640") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(V^{2} | $O(V^{2} \log\log E)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 10:19, 28 April 2023
Time Complexity
$O(V^{2} \log\log E)$
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