Approximation algorithms for the k-depots Hamiltonian path problem.
Yichen YangZhaohui LiuWei YuPublished in: Optim. Lett. (2022)
Keyphrases
- approximation algorithms
- hamiltonian path
- graph theoretic
- np hard
- special case
- vehicle routing problem
- minimum cost
- vertex cover
- worst case
- facility location problem
- open shop
- set cover
- routing problem
- exact algorithms
- approximation schemes
- network design problem
- approximation ratio
- primal dual
- np hardness
- constant factor
- randomized algorithms
- disjoint paths
- precedence constraints
- approximation guarantees
- multistage
- linear programming
- constant factor approximation