English

A PTAS for Capacitated Vehicle Routing on Trees

Data Structures and Algorithms 2022-04-12 v3

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.

Cite

@article{arxiv.2111.03735,
  title  = {A PTAS for Capacitated Vehicle Routing on Trees},
  author = {Claire Mathieu and Hang Zhou},
  journal= {arXiv preprint arXiv:2111.03735},
  year   = {2022}
}

Comments

Accepted for publication at ICALP 2022

R2 v1 2026-06-24T07:28:27.799Z