10 citations · 16 across the 7 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021★ 10 cited
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…
cs.DS2021
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…