On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542)
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 2126110
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality |
scientific article; zbMATH DE number 2126110 |
Statements
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (English)
0 references
11 January 2005
0 references
Approximation algorithm
0 references
Inapproximability
0 references
Minimum-cost biconnected spanning subgraph
0 references
Graph augmentation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9983454942703248
0 references
0.8752618432044983
0 references
