1.6-approximation algorithm for generalized traveling salesman path problem

Cites work

scientific article; zbMATH DE number 3746840 (Why is no real title available?)
scientific article; zbMATH DE number 1306896 (Why is no real title available?)
A (slightly) improved approximation algorithm for metric TSP
A 1.5-approximation for path TSP
A cutting plane procedure for the travelling salesman problem on road networks
An LP-based approximation algorithm for the generalized traveling salesman path problem
Analysis of Christofides' heuristic: some paths are more difficult than cycles
Approaching 3/2 for the \(s\)-\(t\)-path TSP
Approximation Algorithms for Some Postman Problems
Approximation algorithms via contraction decomposition
Approximation of the double traveling salesman problem with multiple stacks
Complexity and approximation for traveling salesman problems with profits
Contraction decomposition in \(h\)-minor-free graphs and algorithmic applications
Eight-fifth approximation for the path TSP
Improving Christofides' algorithm for the s-t path TSP
On the approximability of the traveling salesman problem
P-Complete Approximation Problems
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
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
Solution of a Large-Scale Traveling-Salesman Problem
Testing membership in matroid polyhedra
The Planar Hamiltonian Circuit Problem is NP-Complete
The traveling salesman problem on a graph and some related integer polyhedra
Traveling salesman problems in temporal graphs
Worst-case analysis of a new heuristic for the travelling salesman problem

This page was built for publication: 1.6-approximation algorithm for generalized traveling salesman path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970730)