2 citations · 4 across the 4 of their papers we have counts for
6 papers
Faster Approximation Scheme for Euclidean -TSP
Ernest van Wijland, Hang Zhou
In the Euclidean -traveling salesman problem (-TSP), we are given points in the -dimensional Euclidean space, for some fixed constant , and a positive integer…
Euclidean Capacitated Vehicle Routing in Random Setting: A -Approximation Algorithm
Zipei Nie, Hang Zhou
We study the unit-demand capacitated vehicle routing problem in the random setting of the Euclidean plane. The objective is to visit random terminals in a square using a set of…
Capacitated Vehicle Routing in Graphic Metrics
Tobias Mömke, Hang Zhou
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 metri…
An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees
Marc Dufay, Claire Mathieu, Hang Zhou
In the Distance-constrained Vehicle Routing Problem (DVRP), we are given a graph with integer edge weights, a depot, a set of terminals, and a distance constraint . The goal…
Unsplittable Euclidean Capacitated Vehicle Routing: A -Approximation Algorithm
Fabrizio Grandoni, Claire Mathieu, Hang Zhou
In the unsplittable capacitated vehicle routing problem, we are given a metric space with a vertex called depot and a set of vertices called terminals. Each terminal is associated…
A Tight -Approximation for Unsplittable Capacitated Vehicle Routing on Trees
Claire Mathieu, Hang Zhou
In the unsplittable capacitated vehicle routing problem (UCVRP) on trees, we are given a rooted tree with edge weights and a subset of vertices of the tree called terminals. Each t…