A 3/4 differential approximation algorithm for traveling salesman problem
From MaRDI portal
Publication:6111960
DOI10.1007/978-3-031-20350-3_19arXiv2012.14079OpenAlexW3116039515MaRDI QIDQ6111960
Publication date: 4 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.14079
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Differential approximation results for the traveling salesman and related problems
- A better differential approximation ratio for symmetric TSP
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- Approximation algorithms for the traveling salesman problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Differential approximation results for the traveling salesman problem with distances 1 and 2
- Approximation hardness of Travelling Salesman via weighted amplifiers
- z-Approximations
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- Optimal control of plotting and drilling machines: A case study
- An Algorithm for the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES
- A (slightly) improved approximation algorithm for metric TSP
- A 3/4 differential approximation algorithm for traveling salesman problem
This page was built for publication: A 3/4 differential approximation algorithm for traveling salesman problem
