A PTAS for bounded-capacity vehicle routing in planar graphs
From MaRDI portal
Publication:2285086
DOI10.1007/978-3-030-24766-9_8OpenAlexW2965002304MaRDI QIDQ2285086
Aaron Schild, Amariah Becker, Philip N. Klein
Publication date: 16 January 2020
Full work available at URL: https://arxiv.org/abs/1901.07032
Related Items (9)
A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering ⋮ Improved approximations for capacitated vehicle routing with unsplittable client demands ⋮ A PTAS for Capacitated Vehicle Routing on Trees ⋮ Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension ⋮ Improving the approximation ratio for capacitated vehicle routing ⋮ Efficient approximation of the metric CVRP in spaces of fixed doubling dimension ⋮ Improving the approximation ratio for capacitated vehicle routing ⋮ Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension ⋮ A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
This page was built for publication: A PTAS for bounded-capacity vehicle routing in planar graphs
