A Tight (3/2+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees

02/11/2022
by   Claire Mathieu, et al.
0

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
research
11/05/2021

A PTAS for Capacitated Vehicle Routing on Trees

We give a polynomial time approximation scheme (PTAS) for the unit deman...
research
04/24/2018

A Tight 4/3 Approximation for Capacitated Vehicle Routing in Trees

Given a set of clients with demands, the Capacitated Vehicle Routing pro...
research
10/07/2022

An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees

In the Distance-constrained Vehicle Routing Problem (DVRP), we are given...
research
06/02/2023

Approximation schemes for capacity vehicle routing problems: A survey

Finding the shortest travelling tour of vehicles with capacity k from th...
research
01/26/2019

Star Routing: Between Vehicle Routing and Vertex Cover

We consider an optimization problem posed by an actual newspaper company...
research
11/07/2018

A Tight Analysis of Bethe Approximation for Permanent

We prove that the permanent of nonnegative matrices can be deterministic...
research
03/04/2015

Estimating the Probability of Meeting a Deadline in Hierarchical Plans

Given a hierarchical plan (or schedule) with uncertain task times, we pr...

Please sign up or login with your details

Forgot password? Click here to reset