Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
From MaRDI portal
Publication:2676463
DOI10.1016/j.tcs.2022.08.030OpenAlexW4294862166WikidataQ114129017 ScholiaQ114129017MaRDI QIDQ2676463
Xiaoguang Bao, Wei Yu, Wei Song
Publication date: 27 September 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.08.030
Cites Work
- Unnamed Item
- Unnamed Item
- Improved approximation algorithms for some min-max and minimum cycle cover problems
- An improved approximation algorithm for the clustered traveling salesman problem
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Min-max tree covers of graphs.
- Solving the family traveling salesman problem
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
- Approximation algorithms for some min-max postmen cover problems
- Better approximability results for min-max tree/cycle/path cover problems
- Approximation Algorithms for Min-Max Cycle Cover Problems
- On general routing problems
- Approximation Algorithms for Some Postman Problems
- Restricted delivery problems on a network
- An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
- Some applications of the clustered travelling salesman problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- Exact Algorithms for the Clustered Vehicle Routing Problem
- Approximations for minimum and min-max vehicle routing problems
This page was built for publication: Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
