Solution Bounds for a Hypothetical Polynomial Time Aproximation Algorithm for the TSP
Computational Complexity
2007-05-23 v2
Authors:
A. G. Yaneff
Abstract
Bounds for the optimal tour length for a hypothetical TSP algorithm are derived.
Keywords
Cite
@article{arxiv.cs/0211032,
title = {Solution Bounds for a Hypothetical Polynomial Time Aproximation Algorithm for the TSP},
author = {A. G. Yaneff},
journal= {arXiv preprint arXiv:cs/0211032},
year = {2007}
}
Comments
2 pages
Related papers
View all related →
Computational Complexity · Computer Science
The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme
Yair Bartal, Lee-Ad Gottlieb, Robert Krauthgamer
2016-09-09
Data Structures and Algorithms · Computer Science
An Improved Approximation Algorithm for TSP in the Half Integral Case
Anna Karlin, Nathan Klein, Shayan Oveis Gharan
2019-08-02
Data Structures and Algorithms · Computer Science
Improved FPT Approximation for Non-metric TSP
Evripidis Bampis, Bruno Escoffier, Michalis Xefteris
2024-07-12
Computational Geometry · Computer Science
The traveling salesman problem for lines, balls and planes
Adrian Dumitrescu, Csaba D. Tóth
2015-11-26
Data Structures and Algorithms · Computer Science
A Better-Than-1.6-Approximation for Prize-Collecting TSP
Jannis Blauth, Nathan Klein, Martin Nägele
2025-01-14
Discrete Mathematics · Computer Science
Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP
Vera Traub, Jens Vygen
2019-07-24
Computational Geometry · Computer Science
A quasi-polynomial algorithm for well-spaced hyperbolic TSP
Sándor Kisfaludi-Bak
2020-02-14
Data Structures and Algorithms · Computer Science
Maximum Scatter TSP in Doubling Metrics
László Kozma, Tobias Mömke
2016-06-29
Data Structures and Algorithms · Computer Science
Approximating Asymmetric A Priori TSP beyond the Adaptivity Gap
Manuel Christalla, Luise Puhlmann, Vera Traub
2025-10-21
Data Structures and Algorithms · Computer Science
On the Recoverable Traveling Salesman Problem
Marc Goerigk, Stefan Lendl, Lasse Wulf
2021-11-19
Data Structures and Algorithms · Computer Science
A Heuristic Algorithm Based on Tour Rebuilding Operator for the Traveling Salesman Problem
Yang Li, Junbin Gao, Mingyuan Bai, Chengjun Li +1
2019-11-12
Data Structures and Algorithms · Computer Science
On Approximating Multi-Criteria TSP
Bodo Manthey
2011-07-14
Data Structures and Algorithms · Computer Science
Polynomial time approximation schemes for the traveling repairman and other minimum latency problems
René Sitters
2014-09-22
Data Structures and Algorithms · Computer Science
Counting Locally Optimal Tours in the TSP
Bodo Manthey, Jesse van Rhijn
2024-10-25
Data Structures and Algorithms · Computer Science
Sublinear Algorithms for TSP via Path Covers
Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi
2024-04-30
Optimization and Control · Mathematics
A Quasi-Polynomial Algorithm for Subset-Sum Problems with At Most One Solution
Marius Costandin, Beniamin Costandin
2023-10-09
Data Structures and Algorithms · Computer Science
Approximation Algorithms for Stochastic k-TSP
Alina Ene, Viswanath Nagarajan, Rishi Saket
2016-10-05
Data Structures and Algorithms · Computer Science
Improved guarantees for the a priori TSP
Jannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen
2023-09-20
Data Structures and Algorithms · Computer Science
Approximation Algorithms for Route Planning with Nonlinear Objectives
Ger Yang, Evdokia Nikolova
2015-11-24
Data Structures and Algorithms · Computer Science
A $4/5$ - Approximation Algorithm for the Maximum Traveling Salesman Problem
Szymon Dudycz, Jan Marcinkowski, Katarzyna Paluch, Bartosz Rybicki
2016-03-22
Computational Complexity · Computer Science
On Approximation Lower Bounds for TSP with Bounded Metrics
Marek Karpinski, Richard Schmied
2012-08-09
Data Structures and Algorithms · Computer Science
A 4/3-approximation for TSP on cubic 3-edge-connected graphs
Nishita Aggarwal, Naveen Garg, Swati Gupta
2011-01-31
Computational Geometry · Computer Science
Remarks on d-Dimensional TSP Optimal Tour Length Behaviour
A. G. Yaneff
2007-05-23
Data Structures and Algorithms · Computer Science
Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model
Sharareh Alipour, Ermiya Farokhnejad, Tobias Mömke
2025-01-30
Computational Geometry · Computer Science
The traveling salesman problem for lines and rays in the plane
Adrian Dumitrescu
2012-04-27