@inproceedings{465dbf6ede594914a47eb56e156759a3,
title = "A PTAS for Capacitated Vehicle Routing on Trees",
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.",
keywords = "approximation algorithms, capacitated vehicle routing, combinatorial optimization, graph algorithms",
author = "Claire Mathieu and Hang Zhou",
note = "Publisher Copyright: {\textcopyright} Claire Mathieu and Hang Zhou; licensed under Creative Commons License CC-BY 4.0; 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022 ; Conference date: 04-07-2022 Through 08-07-2022",
year = "2022",
month = jul,
day = "1",
doi = "10.4230/LIPIcs.ICALP.2022.95",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Mikolaj Bojanczyk and Emanuela Merelli and Woodruff, \{David P.\}",
booktitle = "49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022",
}