树上不可分割容量车辆路径问题的紧 $$(1.5+\epsilon)$$-近似算法

A tight $$(1.5+\epsilon )$$-approximation for unsplittable capacitated vehicle routing on trees

• Claire Mathieu
• Hang Zhou 通讯