Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446)
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: Minimum-sum dipolar spanning tree in R^3 |
scientific article; zbMATH DE number 6084812
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum-sum dipolar spanning tree in \(\mathbb R^3\) |
scientific article; zbMATH DE number 6084812 |
Statements
Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (English)
0 references
21 September 2012
0 references
computational geometry
0 references
dipolar spanning tree
0 references
algorithm
0 references
intersection of balls
0 references
communication networks
0 references
0.7901507019996643
0 references
0.7879074215888977
0 references
0.7855243682861328
0 references
0.7791557312011719
0 references
