Tight bounds for christofides' traveling salesman heuristic
From MaRDI portal
Publication:4180168
Cited in
(21)- Truly tight bounds for TSP heuristics
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- On the refinement of bounds of heuristic algorithms for the traveling salesman problem
- Worst-case analysis of two travelling salesman heuristics
- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
- Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns
- SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS
- Min-weight double-tree shortcutting for metric TSP: bounding the approximation ratio
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Special frequency quadrilaterals and an application
- New primal and dual matching heuristics
- An approximation algorithm for the general routing problem
- Topological design of ring networks
- Discrete extremal problems
- A note on heuristics for the traveling salesman problem
- Heuristic methods and applications: A categorized survey
- Approximation algorithms for the Geometric Covering Salesman Problem
- Minimum-weight two-connected spanning networks
- An extension of Christofides heuristic to the k-person travelling salesman problem
This page was built for publication: Tight bounds for christofides' traveling salesman heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4180168)
