A PTAS for Capacitated Vehicle Routing on Trees

Open Webpage

Claire Mathieu, Hang Zhou

Published: 01 Jan 2023, Last Modified: 08 Aug 2024ACM Trans. Algorithms 2023EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We give a polynomial time approximation scheme (PTAS) for the unit demand capacitated vehicle routing problem (CVRP) on trees, for the entire range of the tour capacity. The result extends to the splittable CVRP.