A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees

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]

Authors

Claire Mathieu

This author has not been identified. Look up 'Claire Mathieu' in Google

Hang Zhou 0001

This author has not been identified. Look up 'Hang Zhou 0001' in Google