A Tight (3/2+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees
share
We give a polynomial time (3/2+ϵ)-approximation algorithm for the unsplittable capacitated vehicle routing problem (CVRP) on trees. Our approximation ratio is tight, given that it is NP-hard to approximate this problem to better than a 3/2 factor.
READ FULL TEXT