The Traveling Salesman Problem with Distances One and Two
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 795217
- The traveling-salesman problem
- Traveling salesman problem
- The traveling salesman problem under squared Euclidean distances
- The traveling salesman problem with few inner points
- Computing and Combinatorics
- scientific article; zbMATH DE number 6011205
- Traveling salesman problem with transportation
Cited in
(only showing first 100 items - show all)- Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
- Reoptimization of minimum and maximum traveling salesman's tours
- An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
- The hardness of approximation: Gap location
- The maximum \(f\)-depth spanning tree problem
- Approximating the maximum quadratic assignment problem
- On residual approximation in solution extension problems
- Approximation algorithms for connected graph factors of minimum weight
- Improved integrality gap upper bounds for traveling salesperson problems with distances one and two
- Approximation algorithms for some vehicle routing problems
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example
- Constant factor approximation for ATSP with two edge weights
- Distances between traveling salesman tours
- Approximation algorithms for the traveling salesman problem
- Approximation algorithms for time-dependent orienteering.
- Differential approximation results for the traveling salesman problem with distances 1 and 2
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- On the longest circuit in an alterable digraph
- Labeled traveling salesman problems: complexity and approximation
- Connected facility location via random facility sampling and core detouring
- Vehicle routing with subtours
- The Chinese deliveryman problem
- Approximation of the double traveling salesman problem with multiple stacks
- The maximum binary tree problem
- The \(m\)-Steiner traveling salesman problem with online edge blockages
- Approximation algorithms for some extensions of the maximum profit routing problem
- An approximation algorithm for a general class of parametric optimization problems
- Weighted amplifiers and inapproximability results for travelling salesman problem
- Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension
- Improved approximations for capacitated vehicle routing with unsplittable client demands
- Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem
- \(\frac{13}{9}\)-approximation for graphic TSP
- Nontrivial path covers of graphs: existence, minimization and maximization
- Approximating spanning trees with few branches
- Good triangulations yield good tours
- When the greedy algorithm fails
- Adversarial patrolling with spatially uncertain alarm signals
- Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications
- Approximation algorithms for the traveling repairman and speeding deliveryman problems
- The traveling salesman problem on cubic and subcubic graphs
- An improved upper bound for the TSP in cubic 3-edge-connected graphs
- TSP with bounded metrics
- The approximability of the weighted Hamiltonian path completion problem on a tree
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Approximation algorithms for the scaffolding problem and its generalizations
- A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem
- Vehicle routing on road networks: how good is Euclidean approximation?
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
- MP or not MP: that is the question
- On interference graphs
- (1,2)-Hamiltonian completion on a matching
- Traveling salesman problems in temporal graphs
- Approximability of the multiple stack TSP
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
- A survey on combinatorial optimization in dynamic environments
- Performance guarantees for the TSP with a parameterized triangle inequality
- Towards better inapproximability bounds for TSP: a challenge of global dependencies
- Approximation algorithms for the TSP with sharpened triangle inequality
- Differential approximation results for the traveling salesman and related problems
- Approximation performance of ant colony optimization for the \(\mathrm{TSP}(1,2)\) problem
- Knowing all optimal solutions does not help for TSP reoptimization
- TSP on cubic and subcubic graphs
- Cost-effective designs of fault-tolerant access networks in communication systems
- Constant factor approximation for ATSP with two edge weights (extended abstract)
- The Steiner traveling salesman problem with online edge blockages
- Approximation hardness of graphic TSP on cubic graphs
- An introduction to temporal graphs: an algorithmic perspective
- Approximating Alternative Solutions
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results
- Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem
- Exponential approximation schemata for some network design problems
- On the approximability of some degree-constrained subgraph problems
- Approximation Algorithms for the Traveling Salesman Problem with Range Condition
- Improved Lower Bounds on the Approximability of the Traveling Salesman Problem
- Better approximation algorithms for scaffolding problems
- Computing and Combinatorics
- On testing Hamiltonicity of graphs
- TRAVELING SALESMAN PROBLEM OF SEGMENTS
- Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
- New inapproximability bounds for TSP
- New approximation algorithms for \((1,2)\)-TSP
- On approximating the longest path in a graph
- Intractability of assembly sequencing: unit disks in the plane
- Critical hereditary graph classes: a survey
- Characterizing the integrality gap of the subtour LP for the circulant traveling salesman problem
- On the number of \(k\)-cycles in the assignment problem for random matrices
- A TSP (1,2) application arising in cable assembly shops
- An approximation algorithm for the minimum co-path set problem
- Fundamentals of Computation Theory
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
- An introduction to temporal graphs: an algorithmic perspective
- Reducing Path TSP to TSP
- scientific article; zbMATH DE number 7651154 (Why is no real title available?)
- A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem
- Unconstrained traveling tournament problem is APX-complete
- Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension
- Approximations for the Steiner multicycle problem
- Approximating the metric TSP in linear time
- Recognising permuted Demidenko matrices
- Travelling salesman paths on Demidenko matrices
This page was built for publication: The Traveling Salesman Problem with Distances One and Two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4697080)
