Skip to content

An O(log n)-Approximation Algorithm for (p, q)-Flexible Graph Connectivity via Independent Rounding.

Sharat Ibrahimpur, Lszl A. Vgh

VenueBIPCO
Year2025
ProceedingsIPCO

Browse the full IPCO paper archive.