2000 character limit reached
The Approximation Ratio of the Greedy Algorithm for the Metric Traveling Salesman Problem
Published 23 Dec 2014 in cs.DM, cs.DS, and math.CO | (1412.7366v1)
Abstract: We prove that the approximation ratio of the greedy algorithm for the metric Traveling Salesman Problem is $\Theta(\log n)$. Moreover, we prove that the same result also holds for graphic, Euclidean, and rectilinear instances of the Traveling Salesman Problem. Finally we show that the approximation ratio of the Clarke-Wright savings heuristic for the metric Traveling Salesman Problem is $\Theta(\log n)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.