A nearly time-optimal distributed approximation of minimum cost \(k\)-edge-connected spanning subgraph (Q6538697)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A nearly time-optimal distributed approximation of minimum cost \(k\)-edge-connected spanning subgraph |
scientific article; zbMATH DE number 7848124
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A nearly time-optimal distributed approximation of minimum cost \(k\)-edge-connected spanning subgraph |
scientific article; zbMATH DE number 7848124 |
Statements
A nearly time-optimal distributed approximation of minimum cost \(k\)-edge-connected spanning subgraph (English)
0 references
14 May 2024
0 references
