A nearly time-optimal distributed approximation of minimum cost k-edge-connected spanning subgraph

DOI10.1137/1.9781611977554.CH164MaRDI QIDQ6538697FDO

Authors Michal Dory, Mohsen Ghaffari

Publication date 14 May 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: A nearly time-optimal distributed approximation of minimum cost \(k\)-edge-connected spanning subgraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538697)