Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree (Q5144967)
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 7298290
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree |
scientific article; zbMATH DE number 7298290 |
Statements
Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree (English)
0 references
19 January 2021
0 references
Steiner tree
0 references
approximation algorithms
0 references
connectivity augmentation
0 references
0.9973950386047364
0 references
0.8509212136268616
0 references
0.8503259420394897
0 references
0.8318964242935181
0 references
0.8027222156524658
0 references
