In the Capacitated Vehicle Routing Problem (CVRP), introduced by Dantzig and Ramser in 1959, we are given an $n$-node graph $G=(V,E)$ with metric edges costs $c(e)$, a depot $r\in V$, and an integer vehicle capacity $Q$. The goal is to find a minimum-cost collection of tours, each containing the depot and visiting at m...
Zachary Friggstad, F. Grandoni, Ramin Mousavi et al.· 0 citations
In the weak-strong distance oracle model of Bateni, Dharangutte, Jayaram and Wang (COLT 2024), a metric $(X,d)$ on $n$ points is accessed through two oracles: a cheap weak oracle that returns each queried distance correctly with probability $1-\delta$ and permits arbitrary values on corrupted pairs, chosen by an advers...
Zachary Friggstad, Mahya Jamshidian, A. Vakilian· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.