Matching is as easy as matrix inversion
Combinatorica
The complexity of restricted spanning tree problems
Journal of the ACM (JACM)
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Journal of the ACM (JACM)
Multicriteria Optimization
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
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
Approximating Multi-criteria Max-TSP
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On approximating multicriteria TSP
ACM Transactions on Algorithms (TALG)
Single approximation for the biobjective Max TSP
Theoretical Computer Science
| Hi-index | 0.05 |
We present deterministic approximation algorithms for the multi-criteria maximum traveling salesman problem (Max-TSP). Our algorithms are faster and simpler than the existing randomized algorithms. We devise algorithms for the symmetric and asymmetric multi-criteria Max-TSP that achieve ratios of 1/2k-@e and 1/(4k-2)-@e, respectively, where k is the number of objective functions. For two objective functions, we obtain ratios of 3/8-@e and 1/4-@e for the symmetric and asymmetric TSP, respectively. Our algorithms are self-contained and do not use existing approximation schemes as black boxes.