Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1137/21m1421143 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1137/21M1421143 / rank | |||
Normal rank | |||
Latest revision as of 19:58, 30 December 2024
scientific article; zbMATH DE number 7693610
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
