Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension
From MaRDI portal
Publication:6075756
DOI10.1145/3582500arXiv2106.15034OpenAlexW4318820632MaRDI QIDQ6075756
Unnamed Author, Mohammad R. Salavatipour
Publication date: 23 October 2023
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.15034
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- Improved approximations for capacitated vehicle routing with unsplittable client demands
- A PTAS for bounded-capacity vehicle routing in planar graphs
- A framework for vehicle routing approximation schemes in trees
- An extension of the Das and Mathieu QPTAS to the case of polylog capacity constrained CVRP in metric spaces of a fixed doubling dimension
- The Truck Dispatching Problem
- A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees
- PTAS for the Euclidean Capacitated Vehicle Routing Problem in $$R^d$$
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- Bypassing the embedding
- PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k
- Bounds and Heuristics for Capacitated Routing Problems
- Capacitated arc routing problems
- Capacitated Vehicle Routing on Trees
- Parallel algorithms with optimal speedup for bounded treewidth
- The Traveling Salesman Problem with Distances One and Two
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
- A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs
- Improving the approximation ratio for capacitated vehicle routing
This page was built for publication: Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension
