Claire Mathieu, Hang Zhou 0001. A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees. In Kousha Etessami, Uriel Feige, Gabriele Puppis, editors, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany. Volume 261 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]
@inproceedings{Mathieu023,
title = {A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees},
author = {Claire Mathieu and Hang Zhou 0001},
year = {2023},
doi = {10.4230/LIPIcs.ICALP.2023.91},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.91},
researchr = {https://researchr.org/publication/Mathieu023},
cites = {0},
citedby = {0},
booktitle = {50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany},
editor = {Kousha Etessami and Uriel Feige and Gabriele Puppis},
volume = {261},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-278-5},
}