Davide Bilò

collaborators

3 papers

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

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…