An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem
From MaRDI portal
Recommendations
- An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem
- Approximating the multiple-depot multiple-terminal Hamiltonian path problem
- Approximation algorithms for the \(k\)-depots Hamiltonian path problem
- Approximation algorithms for multiple terminal, Hamiltonian path problems
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
Cites work
- \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem
- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Approximating the multiple-depot multiple-terminal Hamiltonian path problem
- Approximation algorithms for multiple terminal, Hamiltonian path problems
- Approximation algorithms for the \(k\)-depots Hamiltonian path problem
- Efficient algorithms for a family of matroid intersection problems
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
This page was built for publication: An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6123387)
