Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028)
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: Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree |
scientific article; zbMATH DE number 7693610
| 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 7693610 |
Statements
Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (English)
0 references
9 June 2023
0 references
approximation algorithms
0 references
connectivity augmentation
0 references
Steiner tree
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9044038
0 references
0.9035201
0 references
0.9035201
0 references
0.8990798
0 references
0.8988089
0 references
0.8988089
0 references
0 references
