Applegate et al. (Approximate TSP The Traveling-Salesman Problem)

From Algorithm Wiki
Revision as of 10:39, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{2} E)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2006 == Reference == https://www-jstor-org.ezproxy.canberra.edu.au/stable/j.ctt7s8xg")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(V^{2} E)$

Space Complexity

()

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

No, deterministic

Model of Computation

Year

2006

Reference

https://www-jstor-org.ezproxy.canberra.edu.au/stable/j.ctt7s8xg

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Applegate_et_al._(Approximate_TSP_The_Traveling-Salesman_Problem)&oldid=44683"