Avi Kadria

collaborators

3 papers

cs.DS2025

New approximate distance oracles and their applications

Avi Kadria, Liam Roditty

Let $G = (V, E)$ be an undirected graph with $n$ vertices and $m$ edges, and let $μ = m / n$ . A \emph{distance oracle} is a data structure designed to answer approximate distance quer…

cs.DS2025

Improved girth approximation in weighted undirected graphs

Avi Kadria, Liam Roditty, Aaron Sidford +2

Let $G = (V, E, ℓ)$ be a $n$ -node $m$ -edge weighted undirected graph, where $ℓ : E \to (0, \infty)$ is a real \emph{length} function defined on its edges, and let $g$ den…

cs.NI2025

Compact routing schemes in undirected and directed graphs

Avi Kadria, Liam Roditty

In this paper, we study the problem of compact routing schemes in weighted undirected and directed graphs. \textit{For weighted undirected graphs}, more than a decade ago, Chechik…