An extension of the Das and Mathieu QPTAS to the case of polylog capacity constrained CVRP in metric spaces of a fixed doubling dimension

DOI10.1007/978-3-030-49988-4_4zbMath1464.90079OpenAlexW3037510082MaRDI QIDQ2663721

Yuri Ogorodnikov, Daniel Khachay, Mikhail Yu. Khachay

Publication date: 19 April 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-49988-4_4

zbMATH Keywords

Capacitated Vehicle Routing Problem, QPTAS, fixed doubling dimension

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (3)

Improved approximations for capacitated vehicle routing with unsplittable client demands ⋮ Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension ⋮ Efficient approximation of the metric CVRP in spaces of fixed doubling dimension

This page was built for publication: An extension of the Das and Mathieu QPTAS to the case of polylog capacity constrained CVRP in metric spaces of a fixed doubling dimension