On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality |
scientific article |
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
