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