Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7412184
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounded-degree light approximate shortest-path trees in doubling metrics |
scientific article; zbMATH DE number 7412184 |
Statements
Bounded-degree light approximate shortest-path trees in doubling metrics (English)
0 references
21 October 2021
0 references
doubling metrics
0 references
light approximate shortest-path tree
0 references
minimum routing cost tree
0 references
0 references
0.8705916
0 references
0.8704264
0 references
0.86542284
0 references
0 references
0.8543446
0 references
0.85406774
0 references
0.8530121
0 references
0 references
0.85029155
0 references
