Barvinok (Geometric Maximum TSP The Traveling-Salesman Problem)
Revision as of 11:34, 15 February 2023 by Admin (talk | contribs) (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")
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