Approximating minimum-power degree and connectivity problems (Q547290)
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: Approximating minimum-power degree and connectivity problems |
scientific article; zbMATH DE number 5916742
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating minimum-power degree and connectivity problems |
scientific article; zbMATH DE number 5916742 |
Statements
Approximating minimum-power degree and connectivity problems (English)
0 references
1 July 2011
0 references
power
0 references
graphs
0 references
wireless
0 references
degree
0 references
\(k\)-connectivity
0 references
approximation
0 references
1.0000004
0 references
0.9320042
0 references
0.9198275
0 references
0.91748124
0 references
0.9103382
0 references
0.9060806
0 references
0.9016419
0 references
0.9016419
0 references
0.9012233
0 references
