Keerti Choudhary

collaborators

4 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.DS2025

Maximum-Flow and Minimum-Cut Sensitivity Oracles for Directed Graphs

Mridul Ahi, Keerti Choudhary, Shlok Pande +2

Given a digraph $G = (V, E)$ with a designated source $s$ , sink $t$ , and an $(s, t)$ -max-flow of value $I^»$ , we present constructions for max-flow and min-cut sensitivity oracles, a…

cs.DS2025

Efficient Algorithms for Disjoint Shortest Paths Problem and its Extensions

Keerti Choudhary, Amit Kumar, Lakshay Saggi

We study the 2-Disjoint Shortest Paths (2-DSP) problem: given a directed weighted graph and two terminal pairs $(s_{1}, t_{1})$ and $(s_{2}, t_{2})$ , decide whether there exist vertex-disjoi…