Approximation algorithms for the k-depots Hamiltonian path problem
From MaRDI portal
Publication:2128771
DOI10.1007/S11590-021-01774-5zbMATH Open1491.90143OpenAlexW3174352199WikidataQ114222158 ScholiaQ114222158MaRDI QIDQ2128771FDOQ2128771
Authors: Zhaohui Liu, Wei Yu, Yi-Chen Yang 
Publication date: 22 April 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-021-01774-5
Recommendations
- Approximating the multiple-depot multiple-terminal Hamiltonian path problem
- Approximation algorithms for multiple terminal, Hamiltonian path problems
- An approximation algorithm for the three depots Hamiltonian path problem
- \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem
- An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem
approximation algorithmHamiltonian path problemmultiple depotsChristofides-like heuristicmultiple salesmen
Cites Work
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
- Title not available (Why is that?)
- \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Approximation algorithms for multiple terminal, Hamiltonian path problems
- Combinatorial optimization. Theory and algorithms
- An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem
- An approximation algorithm for the three depots Hamiltonian path problem
Cited In (9)
- A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
- Approximation algorithms for multiple terminal, Hamiltonian path problems
- An approximation algorithm for the three depots Hamiltonian path problem
- Approximating the multiple-depot multiple-terminal Hamiltonian path problem
- An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem
- \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem
- An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem
This page was built for publication: Approximation algorithms for the \(k\)-depots Hamiltonian path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128771)
