S. Chechik

activity

20122026

most citedNear Optimal Algorithm for the Directed Single Source Replacement Paths Problem

5 citations · 14 across the 15 of their papers we have counts for

collaborators

Showing 2024 · cs.DSShow all

2 papers · 2 filters

cs.DS2024

Improved Distance (Sensitivity) Oracles with Subquadratic Space

Davide Bilò, Shiri Chechik, Keerti Choudhary +3

A distance oracle (DO) with stretch $(α, β)$ for a graph $G$ is a data structure that, when queried with vertices $s$ and $t$ , returns a value $d (s, t)$ such that $d(s,t)…

cs.DS2024

Faster Algorithms for Dual-Failure Replacement Paths

Shiri Chechik, Tianyi Zhang

Given a simple weighted directed graph $G = (V, E, ω)$ on $n$ vertices as well as two designated terminals $s, t \in V$ , our goal is to compute the shortest path from $s$ to $t$ avo…