Improved Approximation for Unsplittable CVRP via a Greedy Approach

Daniel Ebert, Leonard Weismantel

We devise a polynomial-time $3.159$-approximation algorithm for the metric unsplittable Capacitated Vehicle Routing Problem. We build on the Relative Greedy Algorithm suggested by…