Approximation algorithms for general cluster routing problem
From MaRDI portal
Publication:2019492
DOI10.1007/978-3-030-58150-3_38OpenAlexW3162429168MaRDI QIDQ2019492
Publication date: 21 April 2021
Full work available at URL: https://arxiv.org/abs/2006.12929
Related Items (2)
A LP-based approximation algorithm for generalized traveling salesperson path problem ⋮ Approximation algorithms with constant ratio for general cluster routing problems
Cites Work
- A note on the prize collecting traveling salesman problem
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- An approximation algorithm for the general routing problem
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- The traveling salesman problem and its variations
- Traveling salesman path problems
- P-Complete Approximation Problems
- Restricted delivery problems on a network
- Eight-Fifth Approximation for the Path TSP
- Reducibility among Combinatorial Problems
- The Salesman’s Improved Paths through Forests
- Approaching 3/2 for the s - t -path TSP
This page was built for publication: Approximation algorithms for general cluster routing problem
