Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching (Q4507363)
From MaRDI portal
scientific article; zbMATH DE number 1519265
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching |
scientific article; zbMATH DE number 1519265 |
Statements
Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching (English)
0 references
18 October 2000
0 references
graphs
0 references
directed graphs
0 references
graph connectivity
0 references
edge connectivity
0 references
node connectivity
0 references
matchings
0 references
degree constrained subgraphs
0 references
NP-complete problems
0 references
approximation algorithms
0 references
network design
0 references
