An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An approximation algorithm for minimum-cost vertex-connectivity problems |
scientific article; zbMATH DE number 1002565
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for minimum-cost vertex-connectivity problems |
scientific article; zbMATH DE number 1002565 |
Statements
An approximation algorithm for minimum-cost vertex-connectivity problems (English)
0 references
9 October 1997
0 references
approximation algorithm
0 references
survivable network design
0 references
0 references
0 references
0.9562454
0 references
0.95097363
0 references
0.93400806
0 references
0.9318602
0 references
0.92661744
0 references
0.9215819
0 references
