A framework for vehicle routing approximation schemes in trees

DOI10.1007/978-3-030-24766-9_9OpenAlexW2966539377MaRDI QIDQ2285087

Alice Paul, Amariah Becker

Publication date: 16 January 2020

Full work available at URL: https://arxiv.org/abs/1807.04308

zbMATH Keywords

vehicle routingapproximation algorithmsrooted tree cover

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Related Items (5)

The multiple traveling salesman problem on spiders ⋮ Improved approximations for capacitated vehicle routing with unsplittable client demands ⋮ Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints ⋮ A PTAS for Capacitated Vehicle Routing on Trees ⋮ Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension

This page was built for publication: A framework for vehicle routing approximation schemes in trees