Approximation algorithms for the traveling salesman problem (original) (raw)
Related papers
Differential approximation results for the traveling salesman problem with distances 1 and 2
Jérôme Monnot, Vangelis Th. Paschos
European Journal of Operational Research, 2003
On the bipartite travelling salesman problem
1998
A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem
Lecture Notes in Computer Science, 2022
International Journal of Computational Geometry & Applications, 2009
Approximating the metric 2Peripatetic Salesman Problem
Roberto Calvo, Vangelis Paschos
Algorithmic Operations Research, 2010
An Empirical Analysis of Approximation Algorithms for the Euclidean Traveling Salesman Problem
Approximating the Bipartite TSP and its Biased Generalization
The Traveling Salesman Problem Under Squared Euclidean Distances
Computing Research Repository - CORR, 2010
Approximation algorithms for the black and white traveling salesman problem
2007
Approximation Algorithms for the Dubins' Traveling Salesman Problem
2005
LP-Based Approximation Algorithms for Traveling Salesman Path Problems
Computing Research Repository - CORR, 2011
Labeled traveling salesman problems: Complexity and approximation
A -approximation algorithm for the clustered traveling salesman tour and path problems
Operations Research Letters, 1999
A 4-approximation algorithm for the TSP-Path satisfying a biased triangle inequality
Discrete Applied Mathematics, 2019
An O (log n /log log n )-approximation Algorithm for the Asymmetric Traveling Salesman Problem
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
A novel discretization scheme for the close enough traveling salesman problem
Computers & Operations Research, 2017
2002
On labeled traveling salesman problems
A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
European Journal of Operational Research, 1995
An approximation algorithm for the asymmetric traveling salesman problem
1999
Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
Arxiv preprint arXiv:0711.2399, 2007
3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem
Optimization Letters, 2012
The Metric Travelling Salesman Problem: The Experiment on Pareto-optimal Algorithms
Proceedings of the Institute for System Programming of the RAS, 2017
Approximation algorithms for the bottleneck asymmetric traveling salesman problem
2010
Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
Electronic Notes in Discrete Mathematics, 2009
An approximation algorithm for the curvatureconstrained traveling salesman problem
Proceedings of the 43rd Annual …, 2005
The Traveling Salesman Problem: An overview of exact and approximate algorithms
A multi-matching approximation algorithm for Symmetric Traveling Salesman Problem
Journal of Intelligent & Fuzzy Systems, 2019
Complexity and approximation for Traveling Salesman Problems with profits
Theoretical Computer Science, 2014
The geometric maximum traveling salesman problem
Journal of the ACM, 2003
INFORMS Journal on Computing, 2020
A constant approximation algorithm for the a priori traveling salesman problem
Integer Programming and Combinatorial …, 2008