Approximating \(k\)-edge-connected spanning subgraphs via a near-linear time LP solver (Q6560824)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7870247
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating \(k\)-edge-connected spanning subgraphs via a near-linear time LP solver |
scientific article; zbMATH DE number 7870247 |
Statements
Approximating \(k\)-edge-connected spanning subgraphs via a near-linear time LP solver (English)
0 references
24 June 2024
0 references
approximation algorithms
0 references
data structures
0 references
