O. Neiman

activity

20242026

collaborators

3 papers

cs.DS2026

Path-Reporting Distance Oracles for Vertex-Labeled Graphs

Ofer Neiman, Alon Spector

Let $G = (V, E)$ be a weighted undirected graph, with $n$ vertices. A distance oracle is a data structure that can quickly answer distance queries, with some stretch factor. A seminal…

cs.DS2025

A Unified Framework for Hopsets and Spanners

Ofer Neiman, Idan Shabat

Given an undirected graph $G = (V, E)$ , an {\em $(I^\pm, I^^{2})$ -spanner} $H = (V, E^{'})$ is a subgraph that approximately preserves distances; for every $u, v \in V$ , $d_H(u,v)\le Î±\cdot d_G(u,v)…

cs.DS2024

Lightweight Near-Additive Spanners

Yuval Gitlitz, Ofer Neiman, Richard Spence

An $(I^\pm, I^^{2})$ -spanner of a weighted graph $G = (V, E)$ , is a subgraph $H$ such that for every $u, v \in V$ , $d_{G} (u, v) \leq d_{H} (u, v) \leq I^\pm \cdot d_{G} (u, v) + I^^{2}$ . The main parameters of interest…