An approximation algorithm for the minimum weight vertex-connectivity problem in complete graphs with sharpened triangle inequality. (Q5897356)
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 the minimum weight vertex-connectivity problem in complete graphs with sharpened triangle inequality. |
scientific article; zbMATH DE number 5674152
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for the minimum weight vertex-connectivity problem in complete graphs with sharpened triangle inequality. |
scientific article; zbMATH DE number 5674152 |
Statements
Theoretical Computer Science (English)
0 references
23 February 2010
0 references
0.9258460998535156
0 references
0.8978176712989807
0 references
0.8901743292808533
0 references
