Gutina; Gregory; Yeob; Anders; Zverovich; Alexey ( The Traveling-Salesman Problem)

From Algorithm Wiki

Revision as of 10:39, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == - == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2002 == Reference == https://www.researchgate.net/publication/222408030_Traveling_Salesman_Should_not_be_Greedy_Domination_Analysis_of_Greedy-Type_Heuristics_for_the_TSP")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

-

Space Complexity

()

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

No, deterministic

Model of Computation

Year

2002

Reference

https://www.researchgate.net/publication/222408030_Traveling_Salesman_Should_not_be_Greedy_Domination_Analysis_of_Greedy-Type_Heuristics_for_the_TSP

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Gutina;_Gregory;_Yeob;_Anders;_Zverovich;_Alexey_(_The_Traveling-Salesman_Problem)&oldid=44685"