A simplified \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2 (Q4962218)
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 6968347
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simplified \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2 |
scientific article; zbMATH DE number 6968347 |
Statements
A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2 (English)
0 references
30 October 2018
0 references
edge connectivity
0 references
tree augmentation
0 references
laminar set family
0 references
0.867637038230896
0 references
0.867165207862854
0 references
0.8185172080993652
0 references
0.816663920879364
0 references
