54 citations · 160 across the 36 of their papers we have counts for
40 papers
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…
A Simple Algorithm for Graph Reconstruction
Claire Mathieu, Hang Zhou
How efficiently can we find an unknown graph using distance queries between its vertices? We assume that the unknown graph is connected, unweighted, and has bounded degree. The goa…
A PTAS for Capacitated Vehicle Routing on Trees
Claire Mathieu, Hang Zhou
We give a polynomial time approximation scheme (PTAS) for the unit demand capacitated vehicle routing problem (CVRP) on trees, for the entire range of the tour capacity. The result…
Constrained School Choice with Incomplete Information
Hugo Gimbert, Claire Mathieu, Simon Mauras
School choice is the two-sided matching market where students (on one side) are to be matched with schools (on the other side) based on their mutual preferences. The classical algo…