S. Cohen

collaborators

Showing cs.DSShow all

7 papers · 1 filter

cs.DS2026

Near-Optimal Replacement Path Coverings

Davide Bilò, Keerti Choudhary, Sarel Cohen +1

Let $L$ and $f$ be positive integers. An $(L, f)$ -replacement path covering (RPC) for a graph $G$ is a family $G$ of subgraphs such that, for every set $F$ of at most $f$ …

cs.DS2026

Fault-Tolerant ST-Diameter Oracles

Davide BilÃ², Keerti Choudhary, Sarel Cohen +3

Given two vertex sets $S$ and $T$ in a graph, the $S T$ -diameter is the maximum $s$ - $t$ -distance between vertices $s \in S$ and $t \in T$ . We study the problem of estimating the $ST…

cs.DS2026

Simpler and Improved Replacement Path Coverings

Davide BilÃ², Shiri Chechik, Keerti Choudhary +2

An important tool in the design of fault-tolerant graph data structures are $(L, f)$ -replacement path coverings (RPCs). An RPC is a family $G$ of subgraphs of a given grap…

cs.DS2024

Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks

Davide BilÃ², Keerti Choudhary, Sarel Cohen +2

We design sensitivity oracles for error-prone networks. For a network problem $I^$ , the data structure preprocesses a network $G = (V, E)$ and sensitivity parameter $f$ such that, for…

cs.DS2024

Improved Distance (Sensitivity) Oracles with Subquadratic Space

Davide BilÃ², Shiri Chechik, Keerti Choudhary +3

A distance oracle (DO) with stretch $(I^\pm, I^^{2})$ 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

A New Approach for Approximating Directed Rooted Networks

Sarel Cohen, Lior Kamma, Aikaterini Niklanovits

We consider the k-outconnected directed Steiner tree problem (k-DST). Given a directed edge-weighted graph $G = (V, E, w)$ , where $V = {r} \cup S \cup T$ , and an integer $k$ , the goal i…