We give a polynomial time $(3/2+\epsilon)$-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.
翻译:我们给树上无法解决的机动车辆路由问题(CVRP)给出了多元时间(3/2 ⁇ psilon ) $(3/2 ⁇ epsilon ) 的接近算法。 我们的近似比率很紧,因为很难将这个问题接近于3/2美元系数。