The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) (Q423908)
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: The bottleneck 2-connected k-Steiner network problem for k 2 |
scientific article; zbMATH DE number 6039472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) |
scientific article; zbMATH DE number 6039472 |
Statements
The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) (English)
0 references
30 May 2012
0 references
bottleneck optimisation
0 references
Steiner network
0 references
2-connected
0 references
block cut-vertex decomposition
0 references
exact algorithm
0 references
wireless networks
0 references
0 references
0.9481126
0 references
0.93060243
0 references
0.90544724
0 references
0.8931333
0 references
0.8891127
0 references
0.8872823
0 references
0.8863163
0 references
0.87830937
0 references
