Barvinok (Geometric Maximum TSP The Traveling-Salesman Problem)
Jump to navigation
Jump to search
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