A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
arXiv:0812.5101 · doi:10.1007/978-3-642-03685-9_23
Abstract
We give a 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem.
6 figures
Cited by in corpus (6)
- Better Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring
- Applications of Discrepancy Theory in Multiobjective Approximation
- An approximation algorithm for the Bandpass-2 problem
- Efficient PTAS for the Maximum Traveling Salesman Problem in a Metric Space of Fixed Doubling Dimension
- Utilitarians Without Utilities: Maximizing Social Welfare for Graph Problems using only Ordinal Preferences - Full Version
- Approximation of the Double Travelling Salesman Problem with Multiple Stacks