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

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

Jump to navigation Jump to search

You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in the group: Users.

You can view and copy the source of this page.

== 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/stable/j.ctt7s8xg

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Applegate_et_al._(Approximate_TSP_The_Traveling-Salesman_Problem)"

Navigation menu