8/7-approximation algorithm for (1,2)-TSP
From MaRDI portal
Cited in
(52)- Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
- An approximation algorithm for a bottleneck traveling salesman problem
- On residual approximation in solution extension problems
- On global integer extrema of real-valued box-constrained multivariate quadratic functions
- Improved integrality gap upper bounds for traveling salesperson problems with distances one and two
- Constant factor approximation for ATSP with two edge weights
- Approximation of the double traveling salesman problem with multiple stacks
- On the approximation ratio of the 3-opt algorithm for the \((1,2)\)-TSP
- Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem
- Method of scaling in approximate solution of the traveling salesman problem
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
- The traveling salesman problem on cubic and subcubic graphs
- TSP with bounded metrics
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
- Discrete heat transfer search for solving travelling salesman problem
- Traveling salesman problems in temporal graphs
- Approximability of the multiple stack TSP
- Towards better inapproximability bounds for TSP: a challenge of global dependencies
- TSP on cubic and subcubic graphs
- Deterministic algorithms for multi-criteria TSP
- Constant factor approximation for ATSP with two edge weights (extended abstract)
- Approximation hardness of graphic TSP on cubic graphs
- Cubic TSP: A 1.3-Approximation
- New inapproximability bounds for TSP
- New approximation algorithms for \((1,2)\)-TSP
- Network Reconstruction – A New Approach to the Traveling Salesman Problem and Complexity
- Characterizing the integrality gap of the subtour LP for the circulant traveling salesman problem
- An approximation algorithm for the minimum co-path set problem
- Approximations for the Steiner multicycle problem
- Geometric Network Creation Games
- Approximating the directed path partition problem
- Improved approximation algorithms for cycle and path packings
- Approximation algorithms for covering vertices by long paths
- An approximation algorithm for covering vertices by \(4^+\)-paths
- Approximations for the Steiner multicycle problem
- Improved approximation algorithms for the \(k\)-path partition problem
- Sublinear algorithms and lower bounds for metric TSP cost estimation
- Approximating maximum-size properly colored forests
- The two-stripe symmetric circulant TSP is in P
- Sublinear algorithms for TSP via path covers
- Approximation algorithms for the maximum path cover problem using long paths
- Approximately covering vertices by order-5 or longer paths
- Path cover using only short paths
- Circulant TSP: vertices of the edge-length polytope and superpolynomial lower bounds
- Approximately covering vertices by order-5 or longer paths
- Circulant TSP special cases: easily-solvable cases and improved approximations
- An improved approximation algorithm for covering vertices by 4^+-paths
- Approximation algorithms for cycle and path partitions in complete graphs
- A minimum spanning tree based heuristic for the travelling salesman tour
- Approximating maximum-size properly colored forests
- Approximately partitioning vertices into short paths
- Approximation results for the weighted \(P_4\) partition problem
This page was built for publication: 8/7-approximation algorithm for (1,2)-TSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581504)
