Preprint
Aug 2026
Near-Optimal Replacement Path Coverings
Let $L$ and $f$ be positive integers. An $(L,f)$-replacement path covering (RPC) for a graph $G$ is a family $\mathcal{G}$ of subgraphs such that, for every set $F$ of at most $f$ edges, there is a subfamily $\mathcal{G}_F \subseteq \mathcal{G}$ with the following properties. (1) No subgraph in $\mathcal{G}_F$ contains...
Davide Bilò, Keerti Choudhary, S. Cohen et al.
· 0 citations