A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
Computer Science and Game Theory
2015-05-13 v1 Discrete Mathematics
Data Structures and Algorithms
Abstract
We give a 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem.
Keywords
Cite
@article{arxiv.0812.5101,
title = {A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem},
author = {Katarzyna Paluch and Marcin Mucha and Aleksander Madry},
journal= {arXiv preprint arXiv:0812.5101},
year = {2015}
}
Comments
6 figures