[HTML][HTML] New inapproximability bounds for TSP
In this paper, we study the approximability of the metric Traveling Salesman Problem (TSP)
and prove new explicit inapproximability bounds for that problem. The best up to now known …
and prove new explicit inapproximability bounds for that problem. The best up to now known …
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization
problems. We design for this problem a randomized polynomial-time algorithm that …
problems. We design for this problem a randomized polynomial-time algorithm that …
Artificial dragonfly algorithm in the Hopfield neural network for optimal Exact Boolean k satisfiability representation
This study proposes a novel hybrid computational approach that integrates the artificial
dragonfly algorithm (ADA) with the Hopfield neural network (HNN) to achieve an optimal …
dragonfly algorithm (ADA) with the Hopfield neural network (HNN) to achieve an optimal …
Discrete symbiotic organism search with excellence coefficients and self-escape for traveling salesman problem
Y Wang, YW Wu, N Xu - Computers & Industrial Engineering, 2019 - Elsevier
Traveling salesman problem (TSP) is one of the well-known NP-hard problems in
combinatorial optimization. The optimal solution of large-scale TSP is difficult to find with …
combinatorial optimization. The optimal solution of large-scale TSP is difficult to find with …
Approximating the held-karp bound for metric TSP in nearly-linear time
We give a nearly linear-time randomized approximation scheme for the Held-Karp bound
[22] for Metric-TSP. Formally, given an undirected edge-weighted graph G=(V, ε) on m edges …
[22] for Metric-TSP. Formally, given an undirected edge-weighted graph G=(V, ε) on m edges …
An improved approximation algorithm for TSP in the half integral case
We design a 1.49993-approximation algorithm for the metric traveling salesperson problem
(TSP) for instances in which an optimal solution to the subtour linear programming …
(TSP) for instances in which an optimal solution to the subtour linear programming …
TSP tours in cubic graphs: beyond 4/3
After a sequence of improvements Boyd et al. TSP on cubic and subcubic graphs, Integer
Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 6655 …
Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 6655 …
[PDF][PDF] Improved inapproximability results for the shortest superstring and related problems
M Karpinski, R Schmied - Proceedings of …, 2013 - crpit.scem.westernsydney.edu.au
We develop a new method for proving explicit approximation lower bounds for the Shortest
Superstring problem, the Maximum Compression problem, the Maximum Asymmetric TSP …
Superstring problem, the Maximum Compression problem, the Maximum Asymmetric TSP …
On approximation lower bounds for TSP with bounded metrics
M Karpinski, R Schmied - arxiv preprint arxiv:1201.5821, 2012 - arxiv.org
We develop a new method for proving explicit approximation lower bounds for TSP
problems with bounded metrics improving on the best up to now known bounds. They …
problems with bounded metrics improving on the best up to now known bounds. They …
Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth
ZK Koh, O Weinstein… - arxiv preprint arxiv …, 2024 - arxiv.org
We present a nearly linear work parallel algorithm for approximating the Held-Karp bound
for the Metric TSP problem. Given an edge-weighted undirected graph $ G=(V, E) $ on $ m …
for the Metric TSP problem. Given an edge-weighted undirected graph $ G=(V, E) $ on $ m …