The Approximation Ratio of the Greedy Algorithm for the Metric Traveling Salesman Problem
Discrete Mathematics
2014-12-24 v1 Data Structures and Algorithms
Combinatorics
Abstract
We prove that the approximation ratio of the greedy algorithm for the metric Traveling Salesman Problem is . 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 .
Keywords
Cite
@article{arxiv.1412.7366,
title = {The Approximation Ratio of the Greedy Algorithm for the Metric Traveling Salesman Problem},
author = {Judith Brecklinghaus and Stefan Hougardy},
journal= {arXiv preprint arXiv:1412.7366},
year = {2014}
}