A Tight $(\frac{3}{2}+ε)$-Approximation for Unsplittable Capacitated Vehicle Routing on Trees

Mathieu, Claire; Zhou, Hang

doi:10.48550/arxiv.2202.05691

2022

DOI: 10.48550/arxiv.2202.05691

|View full text |Cite

Preprint

A Tight $(\frac{3}{2}+ε)$-Approximation for Unsplittable Capacitated Vehicle Routing on Trees

Claire Mathieu¹,

Hang Zhou²

Abstract: 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 NPhard to approximate this problem to better than a 3/2 factor [GW81].

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension

Jayaprakash

Salavatipour

2023

ACM Trans. Algorithms

View full text Add to dashboard Cite

In this paper, we present Approximation Schemes for Capacitated Vehicle Routing Problem (CVRP) on several classes of graphs. In CVRP, introduced by Dantzig and Ramser in 1959 [14], we are given a graph G = ( V , E ) with metric edges costs, a depot r ∈ V , and a vehicle of bounded capacity Q . The goal is to find a minimum cost collection of tours for the vehicle that returns to the depot, each visiting at most Q nodes, such that they cover all the nodes. This generalizes classic TSP and has been studied extensively. In the more general setting, each node v has a demand d v and the total demand of each tour must be no more than Q . Either the demand of each node must be served by one tour (unsplittable) or can be served by multiple tours (splittable). The best known approximation algorithm for general graphs has ratio α + 2(1 − ϵ) (for the unsplittable) and α + 1 − ϵ (for the splittable) for some fixed $\epsilon \gt \frac{1}{3000} $ , where α is the best approximation for TSP. Even for the case of trees, the best approximation ratio is 4/3 [5] and it has been an open question if there is an approximation scheme for this simple class of graphs. Das and Mathieu [15] presented an approximation scheme with time $n^{\log ^{O(1/\epsilon)}n} $ for Euclidean plane ${\mathbb {R}}^2 $ . No other approximation scheme is known for any other class of metrics (without further restrictions on Q ). In this paper, we make significant progress on this classic problem by presenting Quasi-Polynomial Time Approximation Schemes (QPTAS) for graphs of bounded treewidth, graphs of bounded highway dimensions, and graphs of bounded doubling dimensions. For comparison, our result implies an approximation scheme for Euclidean plane with run time $n^{O(\log ^{6}n/\epsilon ^{5})} $ .

show abstract

Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension

Jayaprakash

Salavatipour

2023

ACM Trans. Algorithms

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

A Tight $(\frac{3}{2}+ε)$-Approximation for Unsplittable Capacitated Vehicle Routing on Trees

Abstract: 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 NPhard to approximate this problem to better than a 3/2 factor [GW81].

Cited by 1 publication

References 21 publications

Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension

Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension

Contact Info

Product

Resources

About