A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem

Authors:
Katarzyna Paluch;Marcin Mucha;Aleksander Mądry
Affiliations:
Institute of Computer Science, Wrocław University, Poland;Institute of Informatics, Warsaw University, Poland;CSAIL, MIT, Cambridge, USA
Venue:
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Year:
2009

The traveling salesman problem with distances one and two

Mathematics of Operations Research
Better approximations for max TSP

Information Processing Letters
A 7/8-approximation algorithm for metric Max TSP

Information Processing Letters
Approximation Hardness of TSP with Bounded Metrics

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

Journal of the ACM (JACM)
Long tours and short superstrings

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Deterministic 7/8-Approximation for the Metric Maximum TSP

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Improved deterministic approximation algorithms for Max TSP

Information Processing Letters
35/44-Approximation for asymmetric maximum TSP with triangle inequality

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Deterministic algorithms for multi-criteria TSP

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
On approximating multicriteria TSP

ACM Transactions on Algorithms (TALG)
Multi-Criteria TSP: min and max combined

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Single approximation for biobjective max TSP

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Approximation with a fixed number of solutions of some biobjective maximization problems

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
An improved approximation algorithm for the bandpass problem

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Deterministic algorithms for multi-criteria Max-TSP

Discrete Applied Mathematics
Single approximation for the biobjective Max TSP

Theoretical Computer Science
Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems

Discrete Applied Mathematics
Exponential approximation schemata for some network design problems

Journal of Discrete Algorithms

Hi-index	0.00

We give a deterministic combinatorial 7/9-approximation algorithm for the symmetric maximum traveling salesman problem.