An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes (Q908293)
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 exact algorithm for the bottleneck 2-connected k-Steiner network problem in L_p planes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes |
scientific article |
Statements
An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes (English)
0 references
4 February 2016
0 references
2-connected networks
0 references
bottleneck Steiner
0 references
farthest-colour Voronoi diagrams
0 references
relay augmentation
0 references
wireless sensor networks
0 references
0 references
0 references
0.901905596256256
0 references
0.8256686329841614
0 references
0.8244225382804871
0 references
0.8215425610542297
0 references
0.8163376450538635
0 references
