Johnson; D. S.; McGeoch; L. A. ( The Traveling-Salesman Problem)
Jump to navigation
Jump to search
Time Complexity
$O({2}^{(p(n)$})
Space Complexity
()
Description
Approximate?
Approximate
Approximation Factor:
Randomized?
No, deterministic
Model of Computation
Year
1997
Reference
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.92.1635&rep=rep1&type=pdf