Capacitated Vehicle Routing in Graphic Metrics

10/18/2022
by   Tobias Mömke, et al.
0

We study the capacitated vehicle routing problem in graphic metrics (graphic CVRP). Our main contribution is a new lower bound on the cost of an optimal solution. For graphic metrics, this lower bound is tight and significantly stronger than the well-known bound for general metrics. The proof of the new lower bound is simple and combinatorial. Using this lower bound, we analyze the approximation ratio of the classical iterated tour partitioning algorithm combined with the TSP algorithms for graphic metrics of Christofides [1976], of Mömke-Svensson [JACM 2016], and of Sebő-Vygen [Combinatorica 2014]. In particular, we obtain a 1.95-approximation for the graphic CVRP.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
11/10/2020

Improving the Approximation Ratio for Capacitated Vehicle Routing

We devise a new approximation algorithm for capacitated vehicle routing....
research
02/18/2023

A Tight Lower Bound for Compact Set Packing

This note is devoted to show a simple proof of a tight lower bound of th...
research
08/19/2022

A Ptolemaic Partitioning Mechanism

For many years, exact metric search relied upon the property of triangle...
research
10/26/2018

Interruptible Algorithms for Multiproblem Solving

In this paper we address the problem of designing an interruptible syste...
research
09/12/2022

Joint Upper Lower Bound Normalization for IR Evaluation

In this paper, we present a novel perspective towards IR evaluation by p...
research
12/05/2019

Pinning Down the Strong Wilber 1 Bound for Binary Search Trees

The famous dynamic optimality conjecture of Sleator and Tarjan from 1985...

Please sign up or login with your details

Forgot password? Click here to reset