On a partition LP relaxation for min-cost 2-node connected spanning subgraphs (Q6106538)
From MaRDI portal
scientific article; zbMATH DE number 7705454
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a partition LP relaxation for min-cost 2-node connected spanning subgraphs |
scientific article; zbMATH DE number 7705454 |
Statements
On a partition LP relaxation for min-cost 2-node connected spanning subgraphs (English)
0 references
3 July 2023
0 references
2-node connected graphs
0 references
approximation algorithms
0 references
connectivity augmentation
0 references
greedy algorithm
0 references
network design
0 references
partition relaxation
0 references
0 references
0 references
